A protocol for approximating the measurement distributions of quantum states, extending beyond standard observable estimation is introduced, and tightened gate complexity bounds for practically relevant systems, including those with k-local interactions, long-tailed matrix ensembles, and conserved quantities are provided.
Abstract
We develop quantum algorithms for estimating properties of general matrix functions of Hermitian matrices, with applications to phase estimation, Green's function evaluation, and estimating measurement distributions of time-evolved states. The resulting methods exhibit commutator scaling in matrix parameters similar to that usually found for product formulae, lower circuit depth in other parameters, and require only a single ancillary qubit. Our central primitive consists of classically postprocessing randomly chosen product formulae circuits, which mathematically corresponds to an approximation of a Richardson extrapolation. Within our framework, we introduce a protocol for approximating the measurement distributions of quantum states, extending beyond standard observable estimation. We also provide tightened gate complexity bounds for practically relevant systems, including those with k-local interactions, long-tailed matrix ensembles, and conserved quantities. Finally, numerical experiments confirm that our method can achieve significantly shallower circuit depths than standard product formulae in certain parameter regimes, and highlight the potential of their heuristic application.
Classical simulation of quantum circuits is an essential tool in quantum information science, but its applicability is constrained by the exponential growth of the Hilbert space and the entanglement structure of quantum states. In this work, we introduce Matrix Product Evolution (MPE), a tensor-train representation of quantum circuits constructed along the circuit depth rather than along the qubit index. Within this formulation, the simulation of a quantum circuit is modeled as the contraction of multiple MPE tensors. We develop an efficient contraction strategy based on a zip-up procedure to carry out this contraction in practice. We investigate the numerical behavior of this MPE-based contraction framework through simulations of random quantum circuits and the time evolution of a quantum many-body state. Our results characterize the growth of temporal bond dimensions, clarify how post-selection modifies the contraction cost and approximation accuracy, and identify regimes in which depth-oriented tensor-network contractions provide a useful complement to standard MPS-based simulation approaches.
Haruyuki Kawabe, Minoru Nagai, Tsuyoshi Okubo et al.· 0 citations
The density of states (DoS) encodes the thermodynamic and spectral properties of quantum many-body systems, yet its reconstruction becomes intractable for Hilbert spaces too large to diagonalize. Classically, the kernel polynomial method (KPM) addresses this by combining stochastic trace estimation with a smoothing kernel. Here we show that the Rodeo algorithm---one of the simplest eigenvalue-location protocols for near-term quantum hardware---provides a direct quantum analogue of this approach. Averaging the Rodeo response over Haar-random input states yields the DoS convolved with a spectral kernel fixed entirely by the distribution of evolution times: the random states play the role of stochastic trace estimation, and the temporal sampling distribution that of the damping kernel. The construction requires only the standard single-ancilla circuit, and quantum typicality suppresses the statistical error as the Hilbert-space dimension grows. We derive the estimator and its uncertainties, establish an explicit dictionary between signal-processing window functions and quantum reconstruction kernels, and validate the method on the one-dimensional transverse-field Ising and spin-1 models.
Projected entangled pair states (PEPS) provide an efficient variational ansatz for two-dimensional quantum phases, but computing observables remains challenging because PEPS contraction is generally costly. Here, we parameterize two-dimensional quantum states using variational PEPS subject to isometric constraints and map the resulting ansatz onto monitored quantum circuits, replacing tensor-network contraction with circuit sampling. For infinite cylinders, the transfer matrix defines a quantum channel on the virtual boundary. We use a fixed-point treatment and a monitored-circuit unraveling of this channel to evaluate observables efficiently. Using a constant number of variational parameters and a number of qubits that scales only with the cylinder width, our method yields a phase diagram for the $J_1$-$J_2$ model in qualitative agreement with DMRG results. Because the monitored circuits are compatible with near-term quantum hardware, this approach provides a hybrid quantum-classical framework for simulating two-dimensional quantum many-body systems.
Yuqing Rong, Huanhai Zhou, Guo-Yi Zhu et al.· 0 citations
The quantum-selected configuration interaction identifies important determinantal basis functions through real-time evolution of a reference wavefunction and diagonalizing the Hamiltonian matrix in the resulting selected subspace. However, implementing the full electronic Hamiltonian on noisy quantum devices leads to rapidly increasing circuit complexity, limiting its scalability. To address this issue, we identify the dominant fermionic excitation operators and perform reference-state fidelity loss analysis to construct a compact Hamiltonian, reducing computational overhead while retaining high precision. Applied to Group IIIA monofluorides (BF, AlF, GaF, InF, and TlF), the proposed framework achieves a near-quadratic improvement in Hamiltonian-term scaling, enabling resource-efficient simulations. We employ this framework to compute the relativistic ground-state energies and permanent electric dipole moments (PDMs) of the systems under consideration. After validating the framework via simulations, we demonstrate hardware execution for AlF and TlF on the IBM Marrakesh processor using active spaces of up to 20 qubits. For a 20-qubit TlF system, the reduced Hamiltonian yields a reduction of higher than $ 98\%$ in both circuit depth and two-qubit gate counts, with the resulting PDMs from quantum hardware matching complete active space configuration interaction values within $99.99\%$. These results demonstrate the scalability of this approach on noisy intermediate-scale quantum devices.
S. Sahoo, Abdul Kalam, Kenji Sugisaki et al.· 0 citations
Influence matrices encode the action exerted on local subsystems by the rest of an extended quantum many-body system during their evolution. Thus, knowledge of the influence matrix facilitates computationally efficient simulations of local dynamics. Here we propose a new systematic approach to generating quantum circuits with complex dynamics for which the influence matrices can be written down exactly. In contrast to previous frameworks of this kind, such as dual-unitary circuits, the resulting influence matrices are non-Markovian, exhibiting nontrivial temporal correlations. We explicitly construct a broad family of circuits of this kind, based on dressing free-fermion (matchgate) circuits with appropriately chosen interaction terms. We show that, contrary to previous solvable instances, these circuits produce patterns of correlations that closely resemble that of typical many-body systems. Our approach can be directly interpreted in terms of an error correction scheme where the terms breaking the solvability of the influence matrices play the role of errors.
Samuel H. Pickering, Max McGinley, Bhavik Kumar et al.· 0 citations
Unitary encoding of a single parameter provides quadratic enhancement in precision, with the quantum Fisher information scaling quadratically with the encoding time. However, when estimating multiple parameters simultaneously, this fundamental scaling is not guaranteed. Here, we establish a universal geometric obstruction that dictates when multiparameter quantum metrology fails to achieve simultaneous $t^{-2}$ scaling. By decomposing the Hamiltonian derivatives into components that commute and do not commute with the system Hamiltonian, we prove that linear dependence among the commuting components inevitably generates a slow parameter direction whose Fisher information remains bounded as O$(t^0)$, limiting the overall estimation precision. We demonstrate this mechanism in both discrete- and continuous-variable setups, including collective spin magnetometry and a generalized quantum harmonic oscillator, and contrast it with the Lipkin--Meshkov--Glick model where $t^{-2}$ decay is preserved. Remarkably, while the slow direction fundamentally limits the achievable precision, the measurement incompatibility between fast and slow directions decays as $1/t$, rendering the symmetric logarithmic derivative bound asymptotically saturable. Our framework provides a readily computable diagnostic, given by the Gram matrix of the diagonal generators, for identifying such obstructions in arbitrary multiparameter estimation problems. We further show that the bottleneck can be circumvented by relegating slow directions to nuisance parameters or by employing adaptive quantum control.
Eoin O’Connor, Jiayu He, Matteo G. A. Paris et al.· 0 citations