Quantum Imaginary-Time Evolution with Polynomial Resources in Evolution Time
arXiv:2507.00908 · doi:10.1088/2058-9565/ae7b7f
Abstract
Imaginary-time evolution is fundamental for analyzing quantum many-body systems, with applications spanning quantum chemistry, condensed matter physics, and quantum field theory, yet classical simulation requires exponentially growing resources in both system size and evolution time. While quantum approaches reduce the system-size scaling, existing methods rely on heuristic techniques with measurement precision or success probability that deteriorates as evolution time increases. We present a quantum algorithm that prepares normalized imaginary-time evolved states using an adaptive normalization factor to maintain a stable success probability over long imaginary-time intervals. Our algorithm approximates the target state with error polynomially small in the inverse imaginary time using a polynomial number of elementary quantum gates and a single ancilla qubit, with success probability close to one. When the initial state has reasonable overlap with the ground state, this algorithm also achieves polynomial query complexity in the system size. To our knowledge, this is the first quantum algorithm for imaginary-time evolution with provably polynomial resource scaling in evolution time. Numerical experiments validate our theoretical analysis for evolution time up to 50, demonstrating the algorithm's effectiveness for long-time evolution. Building on this technique, we further develop imaginary-time-evolution-based algorithms for ground-state-related problems and for simulating open quantum systems. These algorithms can reduce circuit depth in certain regimes compared with existing methods, at the expense of higher total query complexity, advancing the practical feasibility of quantum simulation on early fault-tolerant devices.
44 pages including appendix
References in corpus (57)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- A variational eigenvalue solver on a quantum processor
- Quantum computational advantage using photons
- Environment-Assisted Quantum Walks in Photosynthetic Energy Transfer
- An adaptive variational algorithm for exact molecular simulations on a quantum computer
- Dephasing assisted transport: Quantum networks and biomolecules
- Hamiltonian Simulation by Qubitization
- Exponential algorithmic speedup by quantum walk
- Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
- A short introduction to the Lindblad Master Equation
- Entanglement-free Heisenberg-limited phase estimation
- Toward the first quantum simulation with quantum speedup
- Variational ansatz-based quantum simulation of imaginary time evolution
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Quantum Circuits Architecture
- Real- and imaginary-time evolution with compressed quantum circuits
- Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
- Digital quantum simulation of open quantum systems using quantum imaginary time evolution
- A dissipative quantum Church-Turing theorem
- Autonomous Quantum Error Correction and Application to Quantum Sensing with Trapped Ions
- The methodology of resonant equiangular composite quantum gates
- Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
- Quantum Simulation of Open Quantum Systems Using a Unitary Decomposition of Operators
- Variational Study of Fermionic and Bosonic Systems with Non-Gaussian States: Theory and Applications
- Quantum Computation of Finite-Temperature Static and Dynamical Properties of Spin Systems Using Quantum Imaginary Time Evolution
- Quantum Phase Transition in Heisenberg-Kitaev Model
- Early Fault-Tolerant Quantum Computing
- Even shorter quantum circuit for phase estimation on early fault-tolerant quantum computers with applications to ground-state energy estimation
- Implementation of quantum imaginary-time evolution method on NISQ devices: Nonlocal approximation
- Efficient step-merged quantum imaginary time evolution algorithm for quantum chemistry
- Linear combination of Hamiltonian simulation for nonunitary dynamics with optimal state preparation cost
- Quasi-locality and efficient simulation of Markovian quantum dynamics
- A general quantum algorithm for open quantum dynamics demonstrated with the Fenna-Matthews-Olson complex
- Single-ancilla ground state preparation via Lindbladians
- Simulating Open Quantum Systems Using Hamiltonian Simulations
- Efficient Fully-Coherent Quantum Signal Processing Algorithms for Real-Time Dynamics Simulation
- Quantum simulation of antiferromagnetic Heisenberg chain with gate-defined quantum dots
- Quantum Imaginary Time Evolution Algorithm for Quantum Field Theories with Continuous Variables
- Universal terms in the overlap of the ground state of the spin-1/2 XXZ chain with the Néel state
- Reversing Lindblad Dynamics via Continuous Petz Recovery Map
- Hybrid quantum-classical algorithm for computing imaginary-time correlation functions
- An Alternative Approach to Quantum Imaginary Time Evolution
- Quantum Phase Processing and its Applications in Estimating Phase and Entropies
- Fragmented imaginary-time evolution for early-stage quantum signal processors
- Adaptive variational simulation for open quantum systems
- Quantum Multiple Eigenvalue Gaussian filtered Search: an efficient and versatile quantum phase estimation method
- Wave Matrix Lindbladization I: Quantum Programs for Simulating Markovian Dynamics
- Efficient quantum imaginary time evolution by drifting real time evolution: an approach with low gate and measurement complexity
- Wave Matrix Lindbladization II: General Lindbladians, Linear Combinations, and Polynomials
- Design nearly optimal quantum algorithm for linear differential equations via Lindbladians
- Double-bracket quantum algorithms for quantum imaginary-time evolution
- Exponentially reduced circuit depths in Lindbladian simulation
- Computing n-time correlation functions without ancilla qubits
- Imaginary Hamiltonian variational ansatz for combinatorial optimization problems
- Double-bracket algorithm for quantum signal processing without post-selection
- Towards robust variational quantum simulation of Lindblad dynamics via stochastic Magnus expansion
- Role of Riemannian geometry in double-bracket quantum imaginary-time evolution