Sparse-QITE: Discovering Compact Generators for Quantum Imaginary-Time Evolution via Regularization Methods
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 4D. 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.
Related
- [SUPERSEDED] Physics-Informed AI and Quantum Technologies for Certifiable Real-Time Control of Compact Fusion Generators
- svPITE: A Python package for the state-vector-based probabilistic imaginary-time evolution algorithm
- svPITE: A Python package for the state-vector-based probabilistic imaginary-time evolution algorithm
- Quantum Imaginary Time Evolution on an Infinite 1D Chain
- Probabilistic imaginary-time evolution via compiled diagonal representations
BibTeX
@misc{gomezlurbe2026sparseqite,
title = {{Sparse-QITE: Discovering Compact Generators for Quantum Imaginary-Time Evolution via Regularization Methods}},
author = {Rafael Gómez-Lurbe and Luca Ion and Alberto Acevedo and Andreu Anglés-Castillo},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.20791},
eprint = {2610.20791},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.20791},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Sparse-QITE: Discovering Compact Generators for Quantum Imaginary-Time Evolution via Regularization Methods
AU - Rafael Gómez-Lurbe
AU - Luca Ion
AU - Alberto Acevedo
AU - Andreu Anglés-Castillo
PY - 2026
DA - 2026/10/14
PB - arXiv
DO - 10.48550/arxiv.2610.20791
UR - https://arxiv.org/abs/2610.20791
AB - 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.
ER -