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:2610.20791

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

Rafael Gómez-Lurbe, Luca Ion, Alberto Acevedo, Andreu Anglés-Castillo

quant-phSubmitted Oct 14, 2026• Announced Oct 16, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

AI Summary

QITE approximates local imaginary-time updates with unitary generators expanded in up to $4^D$ Pauli strings. This paper asks whether sparse generators can reproduce QITE trajectories while reducing implementation costs. Sparse-QITE adds an $\ell_1$ penalty to the quadratic coefficient objective, with a small ridge term for stability, and solves the convex problem using FISTA. The implementation also refits coefficients on the selected support to reduce shrinkage bias. Benchmarks use eight-spin periodic transverse-field Ising chains in ordered and disordered regimes and an antiferromagnetic Heisenberg chain. At final fidelity at least $0.999$ with standard QITE, representative Ising runs retain $3.03\%$ and $16.0\%$ of its accumulated generator terms, respectively. Domain-size sweeps over $D=2,\ldots,7$ show slower support growth than the full pool and approximate saturation in some regimes. Suzuki decomposition and transpilation yield gate counts around $1\%$ of standard QITE in some large-domain cases. Adaptive regularization controls the local objective mismatch; a heuristic discovery-and-freezing variant reduces subsequent expectation-value requirements. For pool size $M$ and minimum real-Gram eigenvalue $\kappa$, the sparse-versus-ridge tangent error is bounded by $\frac{\lambda}{2}\sqrt{M/(\kappa+\rho)}$. A trajectory bound is also derived, but its exponential stability factor makes it quantitatively uninformative at the numerical ridge value $\rho=10^{-10}$. The basic method retains full-pool measurement costs. The experiments establish no asymptotic scaling law; support freezing has no guarantee against missing later operators, and adaptive binary search assumes mismatch monotonicity not guaranteed with ridge regularization. Larger-system behavior and realistic-noise performance remain open.

Little sign of AI-generated textIncrementalSmall numerics onlyMissing comparison

Error found: The ordered-phase λ=1 table row reports zero implemented terms but a ground-state fidelity of 1.36×10^-7, whereas the declared unchanged initial state has fidelity approximately 0.436 for the stated Hamiltonian. The implementation debiases elastic-net solutions, but the paper does not establish its adaptive-search justification for these debiased coefficients, although some local error bounds can be extended. The paper defines active support as a union of distinct Pauli strings but reports resource counts that include repeated occurrences across separate local generators.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Qubit-Adaptive Variational Quantum Imaginary Time Evolution: A Resource-Efficient Algorithm for Ground-State Preparation of Correlated Molecules on Near-Term Quantum Computers

Thitiwuth Chaiyatho, Zhenyu Li, Jin‐Shi Xu +2 more

Preparing ground states of correlated molecules on near-term quantum computers requires algorithms that are both accurate and resource-efficient. We introduce the qubit-adaptive variational quantum imaginary time evolution (QAITE) algorithm, which synthesizes the systematic convergence of imaginary-time evolution with hardware-efficient, adaptive ansatz construction. By integrating the linear-scaling qubit operator pool into the adaptive variational quantum imaginary time evolution framework, QAITE deterministically constructs a compact ansatz without costly classical optimization loops. Numerical simulations for molecular systems (H4, LiH, H2O, BeH2), benchmarked against our own implementations of established adaptive algorithms under identical conditions, show that QAITE achieves chemical accuracy with a 15-45% reduction in CNOT gates compared to the standard adaptive variational quantum imaginary time evolution (AVQITE) method. For hydrogen chains (RHH = 1.5 Å, N = 6-16 qubits), QAITE's circuit complexity grows approximately quadratically and remains the lowest of the four methods at every system size, reaching 31% fewer CNOT gates than AVQITE at 16 qubits─a saving of 1322 gates. This efficiency extends to heterogeneous (LiH)n and (HBe)n chains, where QAITE maintains a CNOT gate ratio below 1 for all sizes studied (e.g., 0.81 for (LiH)2). We further show that the deterministic parameter update is numerically robust: the results are insensitive to the regularization of the quantum geometric tensor over at least 4 orders of magnitude, and chemical accuracy is retained under realistic shot noise applied to both the quantum geometric tensor and the force vector. By outperforming established adaptive algorithms in both absolute gate count and scaling, QAITE establishes a promising, scalable pathway for quantum molecular simulations on noisy intermediate-scale quantum devices.

Journal of Chemical Theory and Computation•Sep 26, 2026•0 citations

Efficient Quantum Imaginary Time Evolution by Drifting Real-Time Evolution: An Approach with Low Gate and Measurement Complexity

Yifei Huang, Yuguo Shao, Weiluo Ren +2 more

Quantum imaginary time evolution (QITE) is one of the promising candidates for finding the eigenvalues and eigenstates of a Hamiltonian on a quantum computer. However, the original proposal suffers from large circuit depth and measurements due to the size of the Pauli operator pool and Trotterization. To alleviate the requirement for deep circuits, we propose a time-dependent drifting scheme inspired by the qDRIFT algorithm [Campbell, E. Phys. Rev. Lett. 2019, 123, 070503]. We show that this drifting scheme removes the depth dependency on the size of the operator pool and converges inversely with respect to the number of steps. We further propose a deterministic algorithm that selects the dominant Pauli term to reduce the fluctuation for the ground state preparation. We also introduce an efficient measurement reduction scheme across Trotter steps that removes its cost dependence on the number of iterations. We analyze the main source of error for our scheme both theoretically and numerically. We numerically test the validity of depth reduction, convergence performance of our algorithms, and the faithfulness of the approximation for our measurement reduction scheme on several benchmark molecules. In particular, the results on the LiH molecule give circuit depths comparable to that of the advanced adaptive variational quantum eigensolver (VQE) methods while requiring much fewer measurements.

arXiv:2203.11112•Journal of Chemical Theory and Computation•Jun 15, 2023•21 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

Constant-Depth Quantum Imaginary Time Evolution Using Dynamic Fan-out Circuits

Albert Lund, Erika Magnusson, Werner Dobrautz +1 more

Dynamic quantum circuits combine mid-circuit measurement with classical feed-forward, enabling circuit constructions with reduced entangling-gate depth. Here, we investigate their use in Quantum Imaginary Time Evolution (QITE), where circuit depth and parameter growth limit practical implementations of ground-state preparation. For dense classical optimization Hamiltonians, we introduce a reduced-parameter QITE ansatz that restricts entanglement generation via a small set of control qubits, enabling each QITE layer to be implemented with constant two-qubit gate depth using fan-out-based dynamic circuits. In noiseless simulations of exact cover and set partitioning instances, the reduced ansatz yields a higher success probability than standard QITE approaches. We implement unitary, dynamic fan-out, and semi-classical adaptive variants on IBM superconducting hardware. The semi-classical variant performs favorably to the unitary implementation, while the fully dynamic construction exposes the trade-offs between entangling-depth reduction and measurement and feed-forward overhead associated to dynamic circuit implementations. Using a fidelity threshold of 0.5 relative to the noiseless QITE ansatz, we show that dynamic fan-out based QITE would outperform unitary implementations on current devices when the measurement and two-qubit gate errors are reduced by 65% and the feedback latency is halved.

quant-pharXiv:2603.05156•Mar 6, 2026•3 citations

Multiple-time Quantum Imaginary Time Evolution

Julio Del Castillo, Mats Granath, Evert van Nieuwenburg

Quantum Imaginary-Time Evolution (QITE) is a powerful method for preparing ground states on quantum hardware. However, executing QITE has costly measurement budgets for general Hamiltonians. Both fidelity and computational cost are strongly dependent on the definition of suitable local domains and Hamiltonian partitions. In this work, we introduce the Multiple-Time QITE algorithm (MT-QITE). We show how using more than one imaginary time substantially improves the fidelity of the resulting ground state as well as the measurement overhead with respect to the previously published QITE algorithm, while preserving its deterministic character and its independence from ad hoc ansatze. Moreover, unlike QITE and other QITE-based algorithms, MT-QITE is parallelizable, and we show that even in Hamiltonians with non-local interactions, partitioning may entail a computational advantage.

quant-pharXiv:2512.10875•Dec 12, 2025•1 citation

Constrained Quantum Imaginary Time in Krylov Space

Daniele Cuomo, Luis Cort Barrada, Michał Studziński +1 more

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.

arXiv:2611.07800•Nov 5, 2026•0 citations
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.
QITE approximates local imaginary-time updates with unitary generators expanded in up to 4D4^D4D Pauli strings. This paper asks whether sparse generators can reproduce QITE trajectories while reducing implementation costs. Sparse-QITE adds an ℓ1\ell_1ℓ1​ penalty to the quadratic coefficient objective, with a small ridge term for stability, and solves the convex problem using FISTA. The implementation also refits coefficients on the selected support to reduce shrinkage bias.
Benchmarks use eight-spin periodic transverse-field Ising chains in ordered and disordered regimes and an antiferromagnetic Heisenberg chain. At final fidelity at least 0.9990.9990.999 with standard QITE, representative Ising runs retain 3.03%3.03\%3.03% and 16.0%16.0\%16.0% of its accumulated generator terms, respectively. Domain-size sweeps over D=2,…,7D=2,\ldots,7D=2,…,7 show slower support growth than the full pool and approximate saturation in some regimes. Suzuki decomposition and transpilation yield gate counts around 1%1\%1% of standard QITE in some large-domain cases. Adaptive regularization controls the local objective mismatch; a heuristic discovery-and-freezing variant reduces subsequent expectation-value requirements.
For pool size MMM and minimum real-Gram eigenvalue κ\kappaκ, the sparse-versus-ridge tangent error is bounded by λ2M/(κ+ρ)\frac{\lambda}{2}\sqrt{M/(\kappa+\rho)}2λ​M/(κ+ρ)​. A trajectory bound is also derived, but its exponential stability factor makes it quantitatively uninformative at the numerical ridge value ρ=10−10\rho=10^{-10}ρ=10−10. The basic method retains full-pool measurement costs. The experiments establish no asymptotic scaling law; support freezing has no guarantee against missing later operators, and adaptive binary search assumes mismatch monotonicity not guaranteed with ridge regularization. Larger-system behavior and realistic-noise performance remain open.
Preparing ground states of correlated molecules on near-term quantum computers requires algorithms that are both accurate and resource-efficient. We introduce the qubit-adaptive variational quantum imaginary time evolution (QAITE) algorithm, which synthesizes the systematic convergence of imaginary-time evolution with hardware-efficient, adaptive ansatz construction. By integrating the linear-scaling qubit operator pool into the adaptive variational quantum imaginary time evolution framework, QAITE deterministically constructs a compact ansatz without costly classical optimization loops. Numerical simulations for molecular systems (H4, LiH, H2O, BeH2), benchmarked against our own implementations of established adaptive algorithms under identical conditions, show that QAITE achieves chemical accuracy with a 15-45% reduction in CNOT gates compared to the standard adaptive variational quantum imaginary time evolution (AVQITE) method. For hydrogen chains (RHH = 1.5 Å, N = 6-16 qubits), QAITE's circuit complexity grows approximately quadratically and remains the lowest of the four methods at every system size, reaching 31% fewer CNOT gates than AVQITE at 16 qubits─a saving of 1322 gates. This efficiency extends to heterogeneous (LiH)n and (HBe)n chains, where QAITE maintains a CNOT gate ratio below 1 for all sizes studied (e.g., 0.81 for (LiH)2). We further show that the deterministic parameter update is numerically robust: the results are insensitive to the regularization of the quantum geometric tensor over at least 4 orders of magnitude, and chemical accuracy is retained under realistic shot noise applied to both the quantum geometric tensor and the force vector. By outperforming established adaptive algorithms in both absolute gate count and scaling, QAITE establishes a promising, scalable pathway for quantum molecular simulations on noisy intermediate-scale quantum devices.
Quantum imaginary time evolution (QITE) is one of the promising candidates for finding the eigenvalues and eigenstates of a Hamiltonian on a quantum computer. However, the original proposal suffers from large circuit depth and measurements due to the size of the Pauli operator pool and Trotterization. To alleviate the requirement for deep circuits, we propose a time-dependent drifting scheme inspired by the qDRIFT algorithm [Campbell, E. Phys. Rev. Lett. 2019, 123, 070503]. We show that this drifting scheme removes the depth dependency on the size of the operator pool and converges inversely with respect to the number of steps. We further propose a deterministic algorithm that selects the dominant Pauli term to reduce the fluctuation for the ground state preparation. We also introduce an efficient measurement reduction scheme across Trotter steps that removes its cost dependence on the number of iterations. We analyze the main source of error for our scheme both theoretically and numerically. We numerically test the validity of depth reduction, convergence performance of our algorithms, and the faithfulness of the approximation for our measurement reduction scheme on several benchmark molecules. In particular, the results on the LiH molecule give circuit depths comparable to that of the advanced adaptive variational quantum eigensolver (VQE) methods while requiring much fewer measurements.
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.
Dynamic quantum circuits combine mid-circuit measurement with classical feed-forward, enabling circuit constructions with reduced entangling-gate depth. Here, we investigate their use in Quantum Imaginary Time Evolution (QITE), where circuit depth and parameter growth limit practical implementations of ground-state preparation. For dense classical optimization Hamiltonians, we introduce a reduced-parameter QITE ansatz that restricts entanglement generation via a small set of control qubits, enabling each QITE layer to be implemented with constant two-qubit gate depth using fan-out-based dynamic circuits. In noiseless simulations of exact cover and set partitioning instances, the reduced ansatz yields a higher success probability than standard QITE approaches. We implement unitary, dynamic fan-out, and semi-classical adaptive variants on IBM superconducting hardware. The semi-classical variant performs favorably to the unitary implementation, while the fully dynamic construction exposes the trade-offs between entangling-depth reduction and measurement and feed-forward overhead associated to dynamic circuit implementations. Using a fidelity threshold of 0.5 relative to the noiseless QITE ansatz, we show that dynamic fan-out based QITE would outperform unitary implementations on current devices when the measurement and two-qubit gate errors are reduced by 65% and the feedback latency is halved.
Quantum Imaginary-Time Evolution (QITE) is a powerful method for preparing ground states on quantum hardware. However, executing QITE has costly measurement budgets for general Hamiltonians. Both fidelity and computational cost are strongly dependent on the definition of suitable local domains and Hamiltonian partitions. In this work, we introduce the Multiple-Time QITE algorithm (MT-QITE). We show how using more than one imaginary time substantially improves the fidelity of the resulting ground state as well as the measurement overhead with respect to the previously published QITE algorithm, while preserving its deterministic character and its independence from ad hoc ansatze. Moreover, unlike QITE and other QITE-based algorithms, MT-QITE is parallelizable, and we show that even in Hamiltonians with non-local interactions, partitioning may entail a computational advantage.
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.