⚛️ quantum physics

Quantum Imaginary-Time Evolution with Polynomial Resources in Evolution Time

This paper introduces a novel quantum algorithm for imaginary-time evolution that achieves provably polynomial resource scaling in both system size and evolution time by utilizing an adaptive normalization factor to maintain stable success probability, thereby enabling efficient ground-state preparation and open-system simulation on early fault-tolerant devices.

Original authors: Lei Zhang, Jizhe Lai, Xian Wu, Xin Wang

Published 2026-07-15

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: Lei Zhang, Jizhe Lai, Xian Wu, Xin Wang

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to find the deepest, most peaceful valley in a vast, foggy mountain range. In the world of quantum physics, this valley is called the "ground state," and finding it helps us understand how materials behave, how chemicals react, and even how the universe works. The tool scientists use to find this valley is called Imaginary-Time Evolution (ITE). Think of it as a magical hiking guide that slowly pushes a wandering traveler (the quantum state) down the slopes until they settle at the very bottom.

For a long time, this hiking guide had a major problem: the longer you walked (the more "imaginary time" you spent), the more likely you were to get lost or run out of supplies. In fact, on old-fashioned computers, the effort required to simulate this hike grew so fast it became impossible for anything but the tiniest mountains. Even on early quantum computers, the guide was a bit shaky; as the hike got longer, the chance of successfully reaching the bottom without crashing dropped so low it was almost zero. It was like trying to walk a tightrope that gets thinner and thinner the further you go.

The Big Breakthrough
In this paper, a team of researchers led by Lei Zhang and Xin Wang has built a new, super-stable hiking guide. Their main finding is a quantum algorithm that can take this imaginary-time hike for a very long time without the success rate crashing. They achieved this by introducing a clever "adaptive normalization factor."

Here is the analogy: Imagine your hiking guide usually gets tired and gives up if the path gets too steep. The old methods tried to fix this by taking tiny, hesitant steps, but that took forever. The new method is like a guide who carries a magical, self-adjusting backpack. As the path gets steeper (as the imaginary time $\tau$ increases), the guide automatically adjusts the weight in the backpack to keep their balance. This keeps the "success probability" (the chance of making it to the bottom) stable and high, even for very long hikes.

What They Proved and What They Rejected
The authors explicitly reject the idea that we must accept exponentially growing costs or crashing success rates as we simulate longer times. They argue against previous methods that relied on "heuristic" (guess-and-check) techniques which often failed to prove they could handle long durations efficiently.

Instead, they proved that their new algorithm uses a number of resources (like computer steps and extra "helper" bits called ancilla qubits) that grow only polynomially with the time of the evolution.

The Proof: They mathematically demonstrated that for a system with a reasonable starting overlap with the target state, they can prepare the final state with an error that is very small (polynomially small in the inverse of time) using a polynomial number of quantum gates.
The Simulation: They didn't just do the math; they ran numerical experiments on a classical computer to simulate their quantum algorithm. They tested it with evolution times up to 50. The results showed the algorithm worked exactly as predicted, with the success probability staying high and the error staying low.

Two Cool Applications
Once they had this stable hiking guide, they used it to solve two other tricky problems:

Finding the Deepest Valley (Ground State Preparation):
They created a new way to find the ground state energy of a system. While other famous methods (like Quantum Phase Estimation) are like high-precision telescopes that require very deep, complex circuits (which are hard to build on today's noisy machines), their new method is like a sturdy, wide-path trail.
- The Trade-off: Their method might need more total "steps" (queries) overall, but the depth of the circuit (how many steps you have to do one after another without stopping) is much shallower.
- The Benefit: This is huge for early quantum computers. If a circuit is too deep, the machine makes mistakes before it finishes. By reducing the depth by a factor related to the initial overlap (specifically $\Omega(\gamma^{-1})$ ), their method makes these calculations much more feasible on current and near-future hardware, even if it requires more total measurements.
Simulating Leaky Boats (Open Quantum Systems):
Real-world quantum systems aren't perfect; they leak energy and interact with their environment (like a boat taking on water). This is called "Lindbladian simulation."
- The Old Way: Previous methods often had to build a circuit that grew huge and complex every time you added a new "leak" (a dissipative term).
- The New Way: Their algorithm removes the dependence on the number of leaks. Whether you have 5 leaks or 500, the "depth" of the circuit stays roughly the same. It trades this for a slightly higher dependence on how the system is written down (Pauli sparsity), but for systems with many local noise channels, this means the circuit can be much shorter and easier to run.

How Sure Are They?
The authors are very confident in their theoretical math; they have proved that the resource scaling is polynomial in time, which is a first for this type of problem. However, for the specific applications like ground-state energy estimation, they rely on a "heuristic assumption" (a reasonable guess that works in practice) to find the perfect starting parameters. They also note that while their math promises super-fast convergence, the numerical simulations they ran showed polynomial convergence due to the limits of classical computer precision.

They didn't claim to have solved every problem in the universe. They didn't say their method works for every possible starting state (if you start with a state that has almost zero overlap with the ground state, it's still hard). But for the vast majority of practical scenarios in quantum chemistry and physics, they have shown a path that is mathematically sound and numerically validated.

The Bottom Line
This paper introduces a quantum algorithm that acts like a self-balancing hiker, allowing us to simulate imaginary-time evolution for long periods without the process falling apart. It proves that we can do this with manageable resources, and it offers a practical way to find ground states and simulate noisy systems on the quantum computers we can actually build today. It's not just a theoretical idea; it's a tool that has been tested in simulations and is ready to help us explore the quantum world more deeply.

Technical Summary: Quantum Imaginary-Time Evolution with Polynomial Resources in Evolution Time

Problem Statement
Imaginary-time evolution (ITE) is a fundamental tool for analyzing quantum many-body systems, enabling the preparation of ground states, thermal states, and the computation of dynamical correlation functions. However, classical simulation of ITE suffers from exponential scaling in both system size and evolution time ( $\tau$ ). While quantum algorithms offer a pathway to mitigate system-size scaling, existing quantum approaches face a critical bottleneck: the success probability of preparing the normalized ITE state typically decays exponentially as the evolution time $\tau$ increases. This forces existing methods to rely on heuristic techniques or fragmented simulations where the total measurement resources required to suppress error accumulation grow exponentially with $\tau$ . Consequently, the theoretical feasibility of simulating ITE with resources polynomial in both system size and evolution time remained an open question.

Methodology
The authors propose a quantum algorithm based on the Quantum Signal Processing (QSP) and Quantum Phase Processing (QPP) frameworks to prepare normalized imaginary-time evolved states with provably polynomial resource scaling in $\tau$ .

Adaptive Normalization: The core innovation is the introduction of an adaptive normalization factor $\lambda \in (0, 1]$ . Instead of approximating the exponential function $e^{-\tau H}$ directly (which leads to vanishing success probabilities), the algorithm approximates a modified function $f_{\tau, \lambda}(x) = \alpha e^{\tau(x-\lambda)}$ on the spectrum of the Hamiltonian.
Stabilizing Success Probability: By selecting $\lambda$ within a specific "comfort region" near the ground-state energy $|\lambda_0|$ (specifically $\lambda \in [|\lambda_0|, |\lambda_0| + \tau^{-1}]$ ), the algorithm ensures that the success probability of the post-selection step is lower-bounded by a constant proportional to $\alpha^2 \gamma^2 e^{-2\gamma^2}$ , where $\gamma$ is the overlap between the initial state and the ground state. This prevents the exponential decay observed in previous works.
Polynomial Approximation: The algorithm utilizes QPP to implement a polynomial transformation of the input unitary $U_H = e^{-iH}$ . The target function is approximated with an error $\epsilon$ that is polynomially small in $\tau^{-1}$ , using a polynomial number of elementary quantum gates and a single ancilla qubit.
Handling Hamiltonian Access: The method addresses two scenarios:
- Oracle Access: When $e^{-iH}$ is accessible directly, the algorithm achieves polynomial query complexity in $\tau$ .
- Pauli Decomposition: When $H$ is given as a sum of Pauli terms, the algorithm uses Trotterization to approximate $e^{-iH}$ , maintaining polynomial scaling under assumptions of non-degenerate gaps and sufficient evolution time.

Key Contributions and Results

First Provably Polynomial ITE Algorithm: The paper presents the first quantum algorithm for imaginary-time evolution that achieves polynomial resource scaling in the evolution time $\tau$ while maintaining high precision. Theorem 2 and Theorem 3 establish that the algorithm prepares the normalized ITE state with error $O(\text{poly}(\tau^{-1}))$ using $\tilde{O}(\text{poly}(n, \tau))$ queries and one ancilla qubit, assuming the initial state has a non-exponentially small overlap with the ground state.
Ground State Preparation and Energy Estimation: The authors adapt the core ITE technique to solve ground-state problems (Algorithm 1). By iteratively adjusting the evolution time $\tau$ $τ$ and the normalization factor $\lambda$ $λ$ , the algorithm simultaneously prepares the ground state and estimates the ground-state energy.
- Depth Reduction: Compared to Heisenberg-limited approaches (e.g., Quantum Phase Estimation or Quantum Eigenvalue Transformation), this method reduces the query depth by a factor of $\Omega(\gamma^{-1})$ . This is achieved by trading off total query complexity (which is higher due to repeated measurements) for shallower circuits, making it more suitable for early fault-tolerant devices where circuit depth is a primary bottleneck.
Open System (Lindbladian) Simulation: The technique is extended to simulate open quantum systems governed by the Lindblad master equation (Algorithm 2). By representing the density matrix in Liouville space, the algorithm simulates the dissipative dynamics using ITE steps.
- Scalability with Dissipative Terms: Unlike existing deterministic methods where circuit depth scales polynomially with the number of jump operators ( $m$ ), the proposed method's per-run circuit depth is independent of $m$ (depending instead on Pauli sparsity $L$ ). This offers a significant advantage for systems with many local noisy channels.

Numerical Validation
Numerical experiments were conducted on antiferromagnetic Heisenberg chains and transverse-field Ising models.

Long-Time Evolution: Simulations up to $\tau = 50$ confirmed that the success probability remains stable (matching the theoretical lower bound) while the state infidelity decreases polynomially with $\tau^{-1}$ .
Ground State Estimation: The adaptive algorithm successfully converged to ground-state energies for 3, 4, and 5-qubit chains, demonstrating exponential convergence of estimation error with respect to computational resources in the tested regime.
Lindbladian Simulation: Results showed that state infidelity decays polynomially with evolution time $t$ , and the total query complexity grows polynomially, validating the theoretical bounds for open-system simulation.

Significance and Claims
The authors claim this work provides the first theoretical foundation for quantum imaginary-time evolution with rigorously proven polynomial resource scaling in evolution time. The significance lies in:

Resolving the Exponential Decay Problem: By introducing adaptive normalization, the algorithm overcomes the exponential resource barrier that has limited previous quantum ITE methods.
Practical Feasibility for Early Fault-Tolerant Devices: The ability to reduce circuit depth (at the cost of higher total query complexity) makes these algorithms particularly relevant for near-term quantum hardware where coherence times limit circuit depth.
Broad Applicability: The framework unifies the simulation of closed-system ground states and open-system dynamics, offering a systematic approach for problems in quantum chemistry, condensed matter physics, and quantum field theory.

The paper maintains a modest tone regarding the trade-offs, acknowledging that while the total query complexity is higher than Heisenberg-limited methods, the reduction in circuit depth is a critical advantage for current hardware constraints. It also notes that the rigorous lower bound on post-selection success probability for open-system simulations remains an open problem in the general case, though numerical evidence suggests favorable performance.

Technical Summary: Quantum Imaginary-Time Evolution with Polynomial Resources in Evolution Time

More like this