Quantum Imaginary-Time Evolution with Polynomial Resources in Time

• URL: http://arxiv.org/abs/2507.00908v1
• Date: Tue, 01 Jul 2025 16:11:47 GMT
• Title: Quantum Imaginary-Time Evolution with Polynomial Resources in Time
• Authors: Lei Zhang, Jizhe Lai, Xian Wu, Xin Wang,
• Abstract summary: We present a quantum algorithm that prepares normalized imaginary-time states using an adaptive normalization factor to maintain stable success probability over large imaginary times.<n>Our algorithm approximates the target state to small errors in inverse imaginary time using elementaryly many quantum gates and a single ancilla qubit.<n> Numerical experiments validate our theoretical results for evolution time up to 50, demonstrating the algorithm's effectiveness for long-time evolution.
• Score: 34.930625575436835
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Imaginary-time evolution is fundamental to analyzing quantum many-body systems, 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 stable success probability over large imaginary times. Our algorithm approximates the target state to polynomially small errors in inverse imaginary time using polynomially many elementary quantum gates and a single ancilla qubit, achieving success probability close to one. When the initial state has reasonable overlap with the ground state, this algorithm also achieves polynomial resource complexity in the system size. We extend this approach to ground-state preparation and ground-state energy estimation, achieving reduced circuit depth compared to existing methods. Numerical experiments validate our theoretical results for evolution time up to 50, demonstrating the algorithm's effectiveness for long-time evolution and its potential applications for early fault-tolerant quantum computing.

Related papers

• Time-dependent Neural Galerkin Method for Quantum Dynamics [42.81677042059531]
  We introduce a classical computational method for quantum dynamics that relies on a global-in-time variational principle.<n>Our scheme computes the entire state trajectory over a finite time window by minimizing a loss function that enforces the Schr"odinger's equation.<n>We showcase the method by simulating global quantum quenches in the paradigmatic Transverse-Field Ising model in both 1D and 2D.
  arXiv  Detail & Related papers  (2024-12-16T13:48:54Z)
• Double-bracket quantum algorithms for quantum imaginary-time evolution [0.0]
  We prove that our Double-Bracket Quantum Imaginary-Time Evolution (DB-QITE) algorithm inherits the cooling guarantees of imaginary-time evolution.<n>We provide gate counts for DB-QITE through numerical simulations in Qrisp.
  arXiv  Detail & Related papers  (2024-12-05T19:00:09Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Stochastic Approximation of Variational Quantum Imaginary Time Evolution [0.716879432974126]
  In quantum computers, the imaginary-time evolution of quantum states is integral to various fields. Here, we suggest a approach to variational quantum imaginary-time evolution, which allows a significant reduction in runtimes. We demonstrate the efficiency of our algorithm in simulations and show a hardware experiment performing the imaginary-time evolution of the transverse field Ising model on 27 qubits.
  arXiv  Detail & Related papers  (2023-05-11T18:00:06Z)
• Quantum Thermal State Preparation [39.91303506884272]
  We introduce simple continuous-time quantum Gibbs samplers for simulating quantum master equations. We construct the first provably accurate and efficient algorithm for preparing certain purified Gibbs states. Our algorithms' costs have a provable dependence on temperature, accuracy, and the mixing time.
  arXiv  Detail & Related papers  (2023-03-31T17:29:56Z)
• Variational Quantum Time Evolution without the Quantum Geometric Tensor [0.6562256987706128]
  variational quantum time evolution is a promising candidate for near-term devices. We show that our algorithm accurately reproduces the system dynamics at a fraction of the cost of standard variational quantum time evolution algorithms. As an application of quantum imaginary-time evolution, we calculate a thermodynamic observable, the energy per site, of the Heisenberg model.
  arXiv  Detail & Related papers  (2023-03-22T18:00:08Z)
• Projection algorithm for state preparation on quantum computers [0.0]
  We present an efficient method to prepare states of a many-body system on quantum hardware. We first isolate individual quantum numbers and then using time evolution to isolate the energy. The total time evolved for an accurate solution is proportional to the ratio of the spectrum range of the trial state to the gap to the lowest excited state.
  arXiv  Detail & Related papers  (2022-11-19T00:19:55Z)
• A Probabilistic Imaginary Time Evolution Algorithm Based on Non-unitary Quantum Circuit [13.1638355883302]
  We propose a probabilistic algorithm for implementing imaginary time evolution based on non-unitary quantum circuit. We demonstrate the feasibility of this method by solving the ground state energy of several quantum many-body systems.
  arXiv  Detail & Related papers  (2022-10-11T09:43:30Z)
• Making Trotterization adaptive and energy-self-correcting for NISQ devices and beyond [0.0]
  Simulation of continuous time evolution requires time discretization on both classical and quantum computers. We introduce a quantum algorithm to solve this problem, providing a controlled solution of the quantum many-body dynamics of local observables. Our algorithm can be potentially useful on a more general level whenever time discretization is involved concerning, for instance, also numerical approaches based on time-evolving block decimation methods.
  arXiv  Detail & Related papers  (2022-09-26T12:54:32Z)
• Error-resilient Monte Carlo quantum simulation of imaginary time [5.625946422295428]
  We propose an algorithm for simulating the imaginary-time evolution and solving the ground-state problem. Compared with quantum phase estimation, the Trotter step number can be thousands of times smaller. Results show that Monte Carlo quantum simulation is promising even without a fully fault-tolerant quantum computer.
  arXiv  Detail & Related papers  (2021-09-16T08:51:24Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Long-Time Error-Mitigating Simulation of Open Quantum Systems on Near Term Quantum Computers [38.860468003121404]
  We study an open quantum system simulation on quantum hardware, which demonstrates robustness to hardware errors even with deep circuits containing up to two thousand entangling gates. We simulate two systems of electrons coupled to an infinite thermal bath: 1) a system of dissipative free electrons in a driving electric field; and 2) the thermalization of two interacting electrons in a single orbital in a magnetic field -- the Hubbard atom. Our results demonstrate that algorithms for simulating open quantum systems are able to far outperform similarly complex non-dissipative algorithms on noisy hardware.
  arXiv  Detail & Related papers  (2021-08-02T21:36:37Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• Bridging the Gap Between the Transient and the Steady State of a Nonequilibrium Quantum System [58.720142291102135]
  Many-body quantum systems in nonequilibrium remain one of the frontiers of many-body physics. Recent work on strongly correlated electrons in DC electric fields illustrated that the system may evolve through successive quasi-thermal states. We demonstrate an extrapolation scheme that uses the short-time transient calculation to obtain the retarded quantities.
  arXiv  Detail & Related papers  (2021-01-04T06:23:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.