---
title: Quantum Imaginary Time Evolution
url: https://www.emergentmind.com/topics/quantum-imaginary-time-evolution-qite-645d3d26-3107-47ee-801c-b3e9d73f5568
type: topic
---

# Quantum Imaginary Time Evolution

Quantum Imaginary Time Evolution (QITE) is a family of quantum algorithms that approximates the non-unitary imaginary-time propagator \(e^{-\beta H}\) by operations that can be executed on quantum hardware. Its canonical use is ground-state preparation: if an initial state \(\ket{\psi_0}\) has nonzero overlap with the ground state \(\ket{\psi_{\mathrm{gs}}}\), then the normalized state
\[
\ket{\psi(\beta)}=
\frac{e^{-\beta H}\ket{\psi_0}}
{\sqrt{\langle \psi_0|e^{-2\beta H}|\psi_0\rangle}}
\]
approaches \(\ket{\psi_{\mathrm{gs}}}\) as \(\beta\to\infty\). Because gate-model hardware implements unitary dynamics rather than \(e^{-\beta H}\), QITE replaces each short imaginary-time step by a unitary, a parameter update, or a postselected block-encoding surrogate. In the literature this basic idea has been developed into deterministic local-unitary schemes, McLachlan-projected variational flows, randomized-metric accelerations, coherent double-bracket constructions, fragmented block-encoding algorithms, and specialized methods for finite-temperature observables, combinatorial optimization, molecular electronic structure, and linear PDEs [2510.02015] [2407.03123] [2405.01313].

## 1. Mathematical basis and geometric interpretation

The foundational observation is that imaginary-time evolution suppresses excited-state components relative to the ground-state component. In one common normalized form, the evolution satisfies
\[
\frac{\partial}{\partial \tau}\ket{\psi(\tau)}=-(H-E_\tau)\ket{\psi(\tau)},
\qquad
E_\tau=\langle\psi(\tau)|H|\psi(\tau)\rangle,
\]
while a finite-time estimate for approximate preparation is
\[
\tau_\eta=\mathcal O\!\left(\frac{1}{\Delta}\log\left(\frac{1}{\gamma_{\text{init}}\eta}\right)\right),
\]
with \(\Delta\le |E_1-E_0|\) a lower bound on the gap and \(\gamma_{\text{init}}=|\langle \Psi_{\text{init}}|\Psi_{\text{gs}}\rangle|\). This makes explicit that overlap and spectral gap jointly control the useful imaginary-time scale [2409.01320].

A complementary formulation treats imaginary-time evolution as a geometric flow. Writing the pure state as the projector \(\Psi(\tau)=|\Psi(\tau)\rangle\langle\Psi(\tau)|\), one has
\[
\frac{\partial \Psi(\tau)}{\partial \tau}=[[\Psi(\tau),H],\Psi(\tau)].
\]
In this representation the flow is the Riemannian gradient flow of the cost
\[
\mathcal L_B(P)=-\frac12\|P-B\|_{\mathrm{HS}}^2
\]
on the unitary orbit \(\mathcal M(A)=\{UAU^\dagger\}\), with
\[
\operatorname{grad}_P\mathcal L_B(P)=-[[P,B],P].
\]
For the QITE specialization \(A=|\Psi_0\rangle\langle\Psi_0|\), \(B=H\), the cost is energy-equivalent:
\[
\mathcal L_H(\Psi(\tau))=E(\tau)-\frac12\bigl(1+\|H\|_{\mathrm{HS}}^2\bigr),
\]
and the energy obeys
\[
\partial_\tau E(\tau)=-2V(\tau),
\qquad
V(\tau)=\langle \Psi(\tau)|(H-E(\tau))^2|\Psi(\tau)\rangle.
\]
This identifies energy variance as the instantaneous speed of cooling and makes clear why eigenstates are stationary points of the flow [2504.01065].

## 2. Original QITE algorithm

The original QITE construction discretizes imaginary time into steps of size \(\Delta\tau\) and seeks, at each step, a Hermitian generator \(A_m\) such that
\[
e^{-i\Delta\tau A_m}\ket{\phi_{m-1}}
\approx
\frac{1}{c}e^{-\Delta\tau H}\ket{\phi_{m-1}},
\qquad
c=\sqrt{\langle \phi_{m-1}|e^{-2\Delta\tau H}|\phi_{m-1}\rangle}.
\]
Expanding
\[
A_m=\sum_I a_I \sigma_I
\]
in a Pauli basis and linearizing \(e^{-i\Delta\tau A_m}\approx 1-i\Delta\tau A_m\) yields a quadratic least-squares objective
\[
f(a)=f_0+\sum_I b_I a_I+\sum_{I,J} a_I S_{IJ} a_J,
\]
with
\[
S_{IJ}=\langle \phi_{m-1}|\sigma_I\sigma_J|\phi_{m-1}\rangle,
\qquad
b_I=\frac{i}{c\Delta\tau}
\langle \phi_{m-1}|e^{-H\Delta\tau}\sigma_I-\sigma_I e^{-H\Delta\tau}|\phi_{m-1}\rangle.
\]
Minimization gives the linear system
\[
(S+S^T)a=-b.
\]
This is the computational core of tomography-based QITE: measure state-dependent correlators, solve a classical linear system, build \(A_m\), and implement the corresponding unitary [2510.02015].

Scalability is obtained by exploiting locality. If
\[
H=\sum_k h[k]
\]
with \(h[k]\) \(T\)-local, then one Trotterizes
\[
e^{-H\Delta\tau}\approx \prod_k e^{-h[k]\Delta\tau},
\]
with Trotter error \(O(\Delta\tau)\), and replaces each local non-unitary factor by a unitary acting on a domain of \(D\) qubits around the support of \(h[k]\). Larger \(D\) captures more entanglement and correlations and generally improves fidelity, but the basis size grows roughly as \(4^D\). In broader many-body and molecular settings, domain choice can be guided by Manhattan distance in lattice systems or by mutual-information-selected orbitals in electronic structure problems, and the distinction between exact global-domain QITE and inexact small-domain QITE becomes practically decisive [2510.02015] [2409.01320].

## 3. Variational and metric-based formulations

Variational QITE (varQITE) replaces the explicit construction of a fresh \(A_m\) at every step by a parameterized circuit
\[
|\psi(\tau)\rangle \approx |\psi(\theta(\tau))\rangle = U(\theta)|0\rangle
\]
and projects imaginary-time dynamics onto the ansatz manifold through the McLachlan variational principle,
\[
\delta \|(H-E(\theta))|\psi(\theta)\rangle\|=0.
\]
This yields
\[
M_{ij}\dot\theta_j=-V_i,
\]
with
\[
M_{ij} =
\mathrm{Re}\!\left[
\frac{\partial \langle \psi[\theta]|}{\partial \theta_i}
\frac{\partial |\psi[\theta]\rangle}{\partial \theta_j}
+
\frac{\partial \langle \psi[\theta]|}{\partial \theta_i}
|\psi[\theta]\rangle
\langle \psi[\theta]|
\frac{\partial |\psi[\theta]\rangle}{\partial \theta_j}
\right],
\]
and
\[
V_i=\mathrm{Re}\!\left(
\frac{\partial\langle \psi(\theta)|}{\partial \theta_i}
H|\psi(\theta)\rangle
\right).
\]
In discrete form,
\[
\theta_{t+1}=\theta_t-\eta M^{-1}V.
\]
Operationally, original QITE is deterministic and systematically improvable through the domain size \(D\), whereas varQITE is easier to deploy on hardware but depends strongly on ansatz expressivity, initialization, and trainability; barren plateaus and convergence to local minima are explicit concerns [2510.02015].

A closely related formulation writes the variational flow in terms of the quantum Fisher information matrix (QFIM),
\[
\mathcal F_Q(\theta(\tau))\,\dot\theta=-2\nabla_\theta E_\tau(\theta(\tau)),
\]
so that the main cost of standard variational QITE is the \(m\times m\) metric estimation, which requires \(\Theta(m^2)\) state preparations for \(m\) parameters. Random-measurement imaginary-time evolution (RMITE) accelerates this by estimating the QFIM from random-basis measurements. For an exact unitary \(2\)-design \(\nu\),
\[
[\mathcal F_Q(\theta)]_{ij}
=
2(2^n+1)\sum_{\boldsymbol s}\mathbb E_{U\sim \nu}
\left[
\frac{\partial p_{\boldsymbol s^U(\theta)}}{\partial \theta_i}
\frac{\partial p_{\boldsymbol s^U(\theta)}}{\partial \theta_j}
\right],
\]
and one sample costs at most \(2m\) state preparations, so \(K\) samples cost \(\Theta(Km)\). A more aggressive family replaces the QFIM by averaged classical Fisher information matrices (CFIMs); these do not guarantee exact McLachlan geometry, but they do satisfy an energy-descent theorem. The relation
\[
\mathbb E_{U\sim \mu_H}[\mathcal F_C^U(\theta)] = \tfrac12 \mathcal F_Q(\theta)
\]
is presented as a conjecture rather than a theorem [2407.03123].

## 4. Resource scaling, stability, and approximation regimes

For original QITE, the brute-force Pauli basis on \(N\) qubits requires \(4^N\) expectation values, while a local-domain implementation reduces the dominant linear system to roughly \(4^D\). In practical code, the main bottleneck for large \(D\) is solving a linear system of \(4^D\) equations, typically via least squares. The matrix \(S\) is often singular, so one uses a pseudo-inverse or least-squares solve; analogous ill-conditioning can arise in varQITE whenever \(M^{-1}\) is required [2510.02015].

The approximation regime is highly problem dependent. In heuristic many-body benchmarks, QITE with a short-range domain can track Trotterized ITE well for some local systems, but long-range spin models, strongly correlated molecular active spaces, and long imaginary-time horizons often destabilize small-domain QITE. The same benchmark study concludes that success is strongly contingent on initial-state quality and on whether the physics can be captured by small local domains [2409.01320].

Norm handling is also not a peripheral issue. Standard ground-state QITE uses normalized trajectories, but excited-state and Krylov-style extensions require accurate norm reconstruction. This has motivated dedicated improvements to the QITE equations and norm estimation procedures in molecular settings, including quantum Lanczos excited-state calculations and folded-spectrum QITE for general excited states [2205.01983].

## 5. Algorithmic variants and hardware-oriented refinements

Several later variants modify either the update rule or the circuit realization while preserving the basic imaginary-time objective. One line replaces the full local unitary compilation by a qDRIFT-style randomized implementation of the QITE generator. In time-dependent drifting QITE,
\[
A^{(j)}=\sum_i a_i^{(j)}P_i
\]
is not implemented as a full product formula; instead one samples one Pauli term with probability \(p_{j,i}=a_i^{(j)}/\|a^{(j)}\|_1\) and applies
\[
e^{i\|a^{(j)}\|_1 P_i \Delta t}.
\]
This removes depth dependence on the operator-pool size, gives inverse-linear convergence in the number of steps, and admits a cross-step measurement-reduction protocol whose total cost for an observable scales as
\[
\mathcal O\!\left(\frac{(1+\|c\|_\infty T)^2}{\varepsilon^2}\right),
\]
independent of the number of time steps \(K\) [2203.11112].

A second line changes the operator manifold itself. For NISQ implementation, nonlocal approximation (NLA) and extended local approximation (eLA) relax the original locality constraint on \(A_m\). In a 10-vertex 3-regular max-cut instance, the paper reports a one-step circuit depth of \(369757\) for LA-D6 versus \(789\) for NLA-D2, while NLA-D3 reached \(E=-12.00\) on a problem whose ground-state energy is \(E_{\rm GS}=-12\) [2005.12715]. Related work on dense classical optimization Hamiltonians introduces a reduced-parameter QITE ansatz in which entanglement is mediated by a small set of pivot qubits, enabling each compressed QITE layer to be implemented with constant two-qubit depth using dynamic fan-out circuits. On current IBM hardware the semi-classical adaptive variant performs favorably to the unitary implementation, whereas the fully dynamic construction exposes the trade-off between entangling-depth reduction and the overhead of mid-circuit measurement and feed-forward. Using a fidelity threshold of \(0.5\) relative to the noiseless QITE ansatz, the paper estimates that dynamic fan-out QITE would outperform unitary implementations when the measurement and two-qubit gate errors are reduced by \(65\%\) and the feedback latency is halved [2603.05156].

Other variants alter the time structure itself. Multiple-Time QITE (MT-QITE) assigns different imaginary times to different Hamiltonian partitions within one Trotter layer. Because all partition terms are treated from the same reference state, measurements can be reused across time-step scans, updates become parallelizable, and benchmark fidelity improved by one to two orders of magnitude after 10 Trotter steps while using about one order of magnitude fewer measurements [2512.10875]. Double-bracket QITE (DB-QITE) instead realizes imaginary-time descent coherently through the group-commutator approximation to Brockett’s double-bracket flow, with discrete cooling law
\[
E_{k+1}\le E_k-2s_kV_k+\mathcal O(s_k^2),
\]
but it inherits intrinsic saddle points near excited eigenstates where the variance nearly vanishes [2504.01065]. In the block-encoding setting, fragmented imaginary-time evolution factorizes
\[
F_\beta(H)=\prod_{l=1}^r F_{\Delta\beta_l}(H)
\]
and reruns short probabilistic fragments sequentially, reducing wasted depth on failed runs. One primitive uses one single ancillary qubit throughout, and another saturates an imaginary-time no-fast-forwarding bound in the regime \(\beta\ll \ln(1/\varepsilon')\) [2110.13180].

## 6. Applications and empirical behavior

Ground-state preparation in spin and molecular systems remains the central application. A review benchmark on the transverse-field Ising model used
\[
H=-J\sum_{i=1}^{N-1} Z_iZ_{i+1}+g\sum_{i=1}^{N}X_i
\]
with \(N=8\), QITE domain sizes \(D=2,4,6\), and a two-repetition hardware-efficient varQITE ansatz. Energy converged on a similar timescale for exact ITE, QITE, and varQITE, while larger \(D\) improved QITE fidelity and energy accuracy [2510.02015]. On superconducting hardware, variational QITE was demonstrated for \(\mathrm{H_2}\) and \(\mathrm{LiH}\), with convergence within 4 iterations. For \(\mathrm{H_2}\), the fidelity improved from about \(39.2\%\) to about \(99.5\%\); for LiH, a cluster-mean-field plus hardware-efficient implementation reached about \(98.2\%\), and a direct 4-qubit UCC implementation reached about \(98.5\%\) [2303.01098].

Molecular applications also show that initial-state design can dominate performance. For dissociating and open-shell systems, replacing Hartree–Fock by a broken-symmetry reference and adding a spin penalty,
\[
H' = H + c S^2,
\]
can accelerate convergence. In stretched \(\mathrm{H_2}\) at \(2.0\) Å with diradical character \(y=0.56\), broken-symmetry QITE reached chemical precision in about \(260\) iterations versus about \(440\) from HF. In square \(\mathrm{H_4}\), broken-symmetry QITE required about \(950\) iterations versus about \(1500\) for HF. For \(\mathrm{N_2}\) dissociation, the paper reports initial fidelities of about \(0.08\) for RHF, about \(0.14\) for BS2, and about \(0.25\) for BS3 at \(2.7\) Å, with the practical crossover for \(\mathrm{H_2}\) discussed near \(y=0.21\) and the advantage especially pronounced by \(y=0.56\) [2504.18156].

QITE has also been used as an optimization algorithm. For PUBO problems such as weighted MaxCut and LABS, a separable linear ansatz
\[
A[s]=\sum_j a_j[s]Y_j
\]
can already perform strongly. On weighted MaxCut, QITE with a separable ansatz often outperforms the Goemans–Williamson algorithm on graphs up to 150 vertices, with average approximation ratio around \(0.95\) for \(N>100\). On LABS, linear-QITE achieved average ground-state probability comparable with \(p=10\) QAOA, and the tested entangling quadratic ansatz showed no significant advantage for sizes up to \(N=9\) [2312.16664].

Beyond zero-temperature ground states, QITE has been used for finite-temperature observables and dynamics. On IBM five-qubit devices, finite-temperature energies, static correlations, dynamical correlators, and excitation spectra were computed for spin Hamiltonians up to four sites. For two-site TFIM observables, the mean absolute percentage error over the tested \(\beta\) range lay between \(1\%\) and \(4\%\), and the extracted spectral peaks at \(\omega=0,\pm5.94,\pm7.18\) were close to exact values \(0,\pm6.00,\pm7.21\) [2009.03542]. A different generalization reinterprets QITE as a solver for linear PDEs by tracking not only the normalized trajectory but also the changing scale of the state vector; in numerical simulations of the heat equation, 1D and 2D solutions on six and ten qubits achieved perfect fidelity and zero mean squared error at \(D=6\) in the reported exact-support cases [2405.01313].

## 7. Limitations, misconceptions, and open problems

A recurrent misconception is to treat QITE as a single algorithm. The literature instead uses the term for several operationally distinct families: local linear-system QITE, McLachlan/VarQITE, randomized-metric approximations such as RMITE, coherent double-bracket schemes, fragmented operator-function methods, and problem-structured low-depth variants. What unifies them is the attempt to approximate the same normalized imaginary-time trajectory, not a single fixed circuit architecture [2510.02015] [2407.03123] [2110.13180].

The main limitations are equally recurrent. Original QITE is deterministic and ansatz-independent in the narrow sense used by the literature, but its cost depends strongly on domain size \(D\), Hamiltonian partitioning, and repeated measurement of large correlation matrices. VarQITE can be easier to implement on hardware, yet its performance depends heavily on ansatz expressivity and initialization and may suffer from barren plateaus or convergence to local minima. In many realistic long-range or strongly correlated systems, small-domain QITE ceases to track ITE reliably, so exact behavior would require essentially global domains [2510.02015] [2409.01320].

Several open technical questions remain unsettled. For RMITE, the sample complexity \(K\) needed for useful metric estimates and the efficient handling of measurement outcomes remain open, and the Haar-average identity for averaged CFIMs is still a conjecture rather than a theorem [2407.03123]. For DB-QITE, saddle points are intrinsic to the geometry rather than pathologies of implementation, but they can create low-variance bottlenecks that are practically severe [2504.01065]. For MT-QITE, gains depend on partition quality and candidate-time optimization can grow combinatorially with the number of partitions [2512.10875]. For dynamic-circuit QITE, constant entangling depth does not by itself guarantee better hardware performance, because measurement error, feed-forward latency, and ancillary overhead can dominate on current devices [2603.05156].

Taken together, these results suggest that QITE is best understood not as a monolithic ground-state routine but as a broader imaginary-time methodology. Its central abstraction—the replacement of \(e^{-\beta H}\) by implementable surrogates that preserve the normalized trajectory—has proved adaptable across ground states, excited states, thermal observables, optimization, and PDEs, but the decisive questions remain structural: overlap with the target state, the geometry of the chosen update manifold, the measurement budget, and the hardware cost of realizing the surrogate dynamics.

Source: https://www.emergentmind.com/topics/quantum-imaginary-time-evolution-qite-645d3d26-3107-47ee-801c-b3e9d73f5568