Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2611.07800

Constrained Quantum Imaginary Time in Krylov Space

Daniele Cuomo, Luis Cort Barrada, Michał Studziński, Robert van Leeuwen

Published Nov 5, 2026• 0 citations
arXivHTMLPDF

Abstract

We introduce constrained quantum imaginary time evolution (CQITE), extending quantum imaginary time evolution (QITE) to constrained-search dynamics for ground-state preparation with prescribed expectation-value constraints. A central challenge in practical QITE is constructing a compact unitary representation of the imaginary-time evolution while maintaining accuracy and controlling the approximation error. We resolve this challenge by deriving an exact characterization of the imaginary-time evolution from the Krylov space generated by repeated applications of the Hamiltonian to the initial state. This characterization induces a hierarchy of operator directions expressed through nested anti-commutators. Truncating the hierarchy produces a systematic static operator pool, with polynomial size in the system size at any fixed truncation order. The resulting construction provides a principled route to compact unitary approximations of imaginary-time dynamics. Numerical tests on spin models show close agreement with exact constrained imaginary-time evolution and small constraint deviations, while a fermionic example yields energies close to the analytic constrained-search reference.

DOI
10.48550/arxiv.2611.07800

Related papers

Sparse-QITE: Discovering Compact Generators for Quantum Imaginary-Time Evolution via Regularization Methods

Rafael Gómez-Lurbe, Luca Ion, Alberto Acevedo +1 more

Quantum imaginary-time evolution (QITE) provides a systematic route to ground-state preparation, but its cost grows rapidly with the locality $D$ of the unitary approximation, for which the local Pauli basis scales as $4^D$. We introduce Sparse-QITE, a regularized formulation that promotes compact generators, reducing the number of quantum operations and yielding circuits with fewer gates and lower depth. We derive rigorous bounds on the sparsification error and benchmark the method in one-dimensional transverse-field Ising and antiferromagnetic Heisenberg models. Sparse-QITE exhibits a controllable sparsity--accuracy trade-off while retaining strong compression even in the high-accuracy regime. In scalability experiments with respect to $D$, the active support grows much more slowly than in standard QITE and, in several regimes, approximately saturates over the domain sizes studied. After circuit construction and transpilation, some of the largest-domain cases require only about $1\%$ of the standard-QITE gate count while maintaining high accuracy. We further introduce adaptive and active-discovery variants: the former selects the regularization strength dynamically during the evolution, while the latter reduces the number of Pauli expectation values that need to be evaluated and, consequently, the measurement requirements. These results establish sparsity-promoting regularization as a route toward more resource-efficient QITE. More broadly, these results suggest that sparsity-promoting regularization may also benefit variational quantum algorithms.

quant-pharXiv:2610.20791•Oct 16, 2026•0 citations

Generating approximate ground states of strongly correlated quantum many-body systems through quantum imaginary time evolution

Michael Kaicher, Florian Dommert, Christopher Wever +3 more

Abstract Most quantum algorithms designed to generate or probe properties of the ground state of a quantum many-body system require as input an initial state with a large overlap with the desired ground state. One approach for preparing such a ground state is Imaginary Time Evolution (ITE). Recent work by [Motta, M. , Sun, C. , Tan, A.T.K. et al (2020)] introduced an algorithm—which we will refer to as Quantum Imaginary Time Evolution (QITE)—that shows how ITE can be approximated by a sequence of unitary operators, making QITE potentially implementable on early fault-tolerant quantum computers. In this work, we provide a heuristic study of the capabilities of the QITE algorithm in approximating the ITE of lattice and molecular electronic structure Hamiltonians. We numerically study the performance of the QITE algorithm when provided with a good classical initial state for a large class of systems, some of which are of interest to industrial applications, and check if QITE is able to qualitatively replicate the ITE behavior and improve over a classical mean-field solution. The systems we consider in this work range from one- and two-dimensional lattice systems of various lattice geometries displaying short- and long-range interactions, to active spaces of molecular electronic structure Hamiltonians. In addition to the comparison of QITE and ITE, we explicitly show how imaginary time evolved fermionic Gaussian states can serve as initial states which can be efficiently computed on classical computers and efficiently implemented on quantum computers for generic spin Hamiltonians in arbitrary lattice geometries and dimensions, which can be of independent interest.

arXiv:2409.01320•Journal of Physics Communications•Jun 23, 2025•1 citation

Exact and Tunable Quantum Krylov Subspaces via Unitary Decomposition

Ayush Asthana

Quantum Krylov subspace methods can extract ground and excited states by diagonalizing the Hamiltonian in a compact variational space. In practice, these spaces are almost always generated by real or imaginary time evolution, forcing a timestep trade-off between dynamical accuracy and basis collapse and often producing ill-conditioned overlap matrices that stall convergence. Here we introduce Quantum Krylov using Unitary Decomposition (QKUD), a time-evolution-free construction that maps Hamiltonian powers to implementable unitaries via the Hermitian transform $\sin(εH)/ε$. QKUD reduces to the exact Hamiltonian-power Krylov recursion as $ε\rightarrow0$, while finite $ε$ provides a controllable deformation that tunes subspace geometry and improves conditioning. Across molecular active-space benchmarks and a frustrated 2D J1-J2 Heisenberg model, QKUD reproduces exact-Krylov convergence in well-conditioned regimes and systematically restores variational improvement when both exact Krylov and time-evolution Krylov stagnate. These results identify overlap conditioning, instead of time-evolution fidelity, is the key resource for robust quantum Krylov simulation and provide a resilient way forward for accurate quantum simulation of challenging quantum many-body problems.

quant-pharXiv:2512.11788•Dec 15, 2025•7 citations

Adaptive time compressed QITE (ACQ) and its geometrical interpretation

Alberto Acevedo Meléndez, Carmen G. Almudéver, Miguel Ángel García-March +8 more

Abstract Imaginary time evolution (ITE) is a well-established method for ground-state preparation, a fundamental problem in many fields such as materials science, chemistry, and optimization. Quantum ITE (QITE) approximates this evolution on quantum hardware but suffers from high circuit depth and numerous measurements. In this work we introduce adaptive-time compressed QITE (ACQ), a novel algorithm that reduces resource-cost by combining adaptive time steps with circuit compression. This approach leverages geometric insights by characterizing its relationship to geodesic trajectories with a measure that distinguishes trajectories in CP N . Recalling that ITE is a gradient flow on the complex projective plane CP N , such trajectory measures allow one to measure the deviation from geodesicity of said flow. For Hamiltonians with only two distinct eigenvalues (spectral cardiality), ITE and QITE exactly trace geodesics, this fact motivates an adaptive strategy for systems whose corresponding spectral cardinality is greater than 2, where QITE unitaries are reused until an energy increase signals departure from the ITE path. This is implemented via a line search for energy minimization. Circuit compression is achieved by approximating the sequence of QITE unitaries with a single element of a one-parameter group. Numerical simulations on the transverse field Ising model and the Heisenberg model demonstrate that ACQ achieves comparable fidelity to standard QITE while significantly reducing the number of QITE optimizations and maintaining fixed circuit depth during propagation. Gate-count estimates and an analysis of the fidelity scaling with truncation parameters are provided. A gate count and performance comparison with the state of the art method double bracket QITE is also performed.

arXiv:2510.15781•Quantum Science and Technology•Jun 5, 2026•2 citations

Constrained search in imaginary time

Markus Penz, Robert van Leeuwen

We introduce an imaginary-time evolution method to evaluate the pure-state constrained-search functional from density-functional theory formulated on finite lattices. Simultaneously, it yields a potential that produces a prescribed density of an eigenstate. Besides being a computational scheme, this allows one to gain theoretical insights into the density-potential mapping. The method can be generalized to the optimization of the expectation value of a general self-adjoint operator on a finite-dimensional Hilbert space under a finite number of expectation-value constraints for commuting self-adjoint operators.

arXiv:2504.05332•Physical Review A•Sep 10, 2025•2 citations

Double-Bracket Quantum Algorithms for Quantum Imaginary-Time Evolution

Marek Gluza, Jeongrak Son, Bi Hong Tiang +5 more

Efficiently preparing approximate ground states of large, strongly correlated systems on quantum hardware is challenging, and yet, nature is innately adept at this. This has motivated the study of thermodynamically inspired approaches to ground-state preparation that aim to replicate cooling processes via imaginary-time evolution. However, synthesizing quantum circuits that efficiently implement imaginary-time evolution is itself difficult, with prior proposals generally adopting heuristic variational approaches or using deep block encodings. Here, we use the insight that quantum imaginary-time evolution is a solution of Brockett's double-bracket flow and synthesize circuits that implement double-bracket flows coherently on the quantum computer. We prove that our double-bracket quantum imaginary-time evolution (DB-QITE) algorithm inherits the cooling guarantees of imaginary-time evolution. Concretely, each step is guaranteed to (i) decrease the energy of an initial approximate ground state by an amount proportional to the energy fluctuations of the initial state and (ii) increase the fidelity with the ground state. We provide gate counts for DB-QITE through numerical simulations in qrisp that demonstrate scenarios where DB-QITE outperforms quantum phase estimation. Thus, DB-QITE provides a means to systematically improve the approximation of a ground state using shallow circuits.

arXiv:2412.04554•Physical Review Letters•Nov 19, 2025•39 citations
We introduce constrained quantum imaginary time evolution (CQITE), extending quantum imaginary time evolution (QITE) to constrained-search dynamics for ground-state preparation with prescribed expectation-value constraints. A central challenge in practical QITE is constructing a compact unitary representation of the imaginary-time evolution while maintaining accuracy and controlling the approximation error. We resolve this challenge by deriving an exact characterization of the imaginary-time evolution from the Krylov space generated by repeated applications of the Hamiltonian to the initial state. This characterization induces a hierarchy of operator directions expressed through nested anti-commutators. Truncating the hierarchy produces a systematic static operator pool, with polynomial size in the system size at any fixed truncation order. The resulting construction provides a principled route to compact unitary approximations of imaginary-time dynamics. Numerical tests on spin models show close agreement with exact constrained imaginary-time evolution and small constraint deviations, while a fermionic example yields energies close to the analytic constrained-search reference.
Quantum imaginary-time evolution (QITE) provides a systematic route to ground-state preparation, but its cost grows rapidly with the locality DDD of the unitary approximation, for which the local Pauli basis scales as 4D4^D4D. We introduce Sparse-QITE, a regularized formulation that promotes compact generators, reducing the number of quantum operations and yielding circuits with fewer gates and lower depth. We derive rigorous bounds on the sparsification error and benchmark the method in one-dimensional transverse-field Ising and antiferromagnetic Heisenberg models. Sparse-QITE exhibits a controllable sparsity--accuracy trade-off while retaining strong compression even in the high-accuracy regime. In scalability experiments with respect to DDD, the active support grows much more slowly than in standard QITE and, in several regimes, approximately saturates over the domain sizes studied. After circuit construction and transpilation, some of the largest-domain cases require only about 1%1\%1% of the standard-QITE gate count while maintaining high accuracy. We further introduce adaptive and active-discovery variants: the former selects the regularization strength dynamically during the evolution, while the latter reduces the number of Pauli expectation values that need to be evaluated and, consequently, the measurement requirements. These results establish sparsity-promoting regularization as a route toward more resource-efficient QITE. More broadly, these results suggest that sparsity-promoting regularization may also benefit variational quantum algorithms.
Abstract Most quantum algorithms designed to generate or probe properties of the ground state of a quantum many-body system require as input an initial state with a large overlap with the desired ground state. One approach for preparing such a ground state is Imaginary Time Evolution (ITE). Recent work by [Motta, M. , Sun, C. , Tan, A.T.K. et al (2020)] introduced an algorithm—which we will refer to as Quantum Imaginary Time Evolution (QITE)—that shows how ITE can be approximated by a sequence of unitary operators, making QITE potentially implementable on early fault-tolerant quantum computers. In this work, we provide a heuristic study of the capabilities of the QITE algorithm in approximating the ITE of lattice and molecular electronic structure Hamiltonians. We numerically study the performance of the QITE algorithm when provided with a good classical initial state for a large class of systems, some of which are of interest to industrial applications, and check if QITE is able to qualitatively replicate the ITE behavior and improve over a classical mean-field solution. The systems we consider in this work range from one- and two-dimensional lattice systems of various lattice geometries displaying short- and long-range interactions, to active spaces of molecular electronic structure Hamiltonians. In addition to the comparison of QITE and ITE, we explicitly show how imaginary time evolved fermionic Gaussian states can serve as initial states which can be efficiently computed on classical computers and efficiently implemented on quantum computers for generic spin Hamiltonians in arbitrary lattice geometries and dimensions, which can be of independent interest.
Quantum Krylov subspace methods can extract ground and excited states by diagonalizing the Hamiltonian in a compact variational space. In practice, these spaces are almost always generated by real or imaginary time evolution, forcing a timestep trade-off between dynamical accuracy and basis collapse and often producing ill-conditioned overlap matrices that stall convergence. Here we introduce Quantum Krylov using Unitary Decomposition (QKUD), a time-evolution-free construction that maps Hamiltonian powers to implementable unitaries via the Hermitian transform sin⁡(εH)/ε\sin(εH)/εsin(εH)/ε. QKUD reduces to the exact Hamiltonian-power Krylov recursion as ε→0ε\rightarrow0ε→0, while finite εεε provides a controllable deformation that tunes subspace geometry and improves conditioning. Across molecular active-space benchmarks and a frustrated 2D J1-J2 Heisenberg model, QKUD reproduces exact-Krylov convergence in well-conditioned regimes and systematically restores variational improvement when both exact Krylov and time-evolution Krylov stagnate. These results identify overlap conditioning, instead of time-evolution fidelity, is the key resource for robust quantum Krylov simulation and provide a resilient way forward for accurate quantum simulation of challenging quantum many-body problems.
Abstract Imaginary time evolution (ITE) is a well-established method for ground-state preparation, a fundamental problem in many fields such as materials science, chemistry, and optimization. Quantum ITE (QITE) approximates this evolution on quantum hardware but suffers from high circuit depth and numerous measurements. In this work we introduce adaptive-time compressed QITE (ACQ), a novel algorithm that reduces resource-cost by combining adaptive time steps with circuit compression. This approach leverages geometric insights by characterizing its relationship to geodesic trajectories with a measure that distinguishes trajectories in CP N . Recalling that ITE is a gradient flow on the complex projective plane CP N , such trajectory measures allow one to measure the deviation from geodesicity of said flow. For Hamiltonians with only two distinct eigenvalues (spectral cardiality), ITE and QITE exactly trace geodesics, this fact motivates an adaptive strategy for systems whose corresponding spectral cardinality is greater than 2, where QITE unitaries are reused until an energy increase signals departure from the ITE path. This is implemented via a line search for energy minimization. Circuit compression is achieved by approximating the sequence of QITE unitaries with a single element of a one-parameter group. Numerical simulations on the transverse field Ising model and the Heisenberg model demonstrate that ACQ achieves comparable fidelity to standard QITE while significantly reducing the number of QITE optimizations and maintaining fixed circuit depth during propagation. Gate-count estimates and an analysis of the fidelity scaling with truncation parameters are provided. A gate count and performance comparison with the state of the art method double bracket QITE is also performed.
We introduce an imaginary-time evolution method to evaluate the pure-state constrained-search functional from density-functional theory formulated on finite lattices. Simultaneously, it yields a potential that produces a prescribed density of an eigenstate. Besides being a computational scheme, this allows one to gain theoretical insights into the density-potential mapping. The method can be generalized to the optimization of the expectation value of a general self-adjoint operator on a finite-dimensional Hilbert space under a finite number of expectation-value constraints for commuting self-adjoint operators.
Efficiently preparing approximate ground states of large, strongly correlated systems on quantum hardware is challenging, and yet, nature is innately adept at this. This has motivated the study of thermodynamically inspired approaches to ground-state preparation that aim to replicate cooling processes via imaginary-time evolution. However, synthesizing quantum circuits that efficiently implement imaginary-time evolution is itself difficult, with prior proposals generally adopting heuristic variational approaches or using deep block encodings. Here, we use the insight that quantum imaginary-time evolution is a solution of Brockett's double-bracket flow and synthesize circuits that implement double-bracket flows coherently on the quantum computer. We prove that our double-bracket quantum imaginary-time evolution (DB-QITE) algorithm inherits the cooling guarantees of imaginary-time evolution. Concretely, each step is guaranteed to (i) decrease the energy of an initial approximate ground state by an amount proportional to the energy fluctuations of the initial state and (ii) increase the fidelity with the ground state. We provide gate counts for DB-QITE through numerical simulations in qrisp that demonstrate scenarios where DB-QITE outperforms quantum phase estimation. Thus, DB-QITE provides a means to systematically improve the approximation of a ground state using shallow circuits.