Adaptive time Compressed QITE (ACQ) and its geometrical interpretation
Alberto Acevedo Meléndez, Carmen G. Almudéver, Miguel Angel Garcia-March, Rafael Gómez-Lurbe, Luca Ion, Mohit Lal Bera, Rodrigo M. Sanz, Somayeh Mehrabankar, Tanmoy Pandit, Armando Pérez, Andreu Anglés-Castillo
TL;DR
The paper develops Adaptive Compressed QITE (ACQ), a geometry-inspired method to efficiently approximate Quantum Imaginary Time Evolution on quantum hardware. By interpreting ITE as a gradient flow on CP^N and leveraging geodesic structure, the authors introduce line-search based adaptive time steps and a one-parameter unitary compression to reduce circuit depth and classical overhead. They derive Newton-style bounds for adaptive steps and demonstrate that ACQ achieves comparable ground-state fidelities to standard QITE with fewer unitary applications, exemplified in the TFIM. This approach offers a practical pathway toward resource-efficient ground-state preparation on near-term quantum devices, with a clear link between geometric trajectories and algorithmic efficiency.
Abstract
Preparing the ground state of a given Hamiltonian is a computational task of interest in many fields, such as material science, chemistry and even some optimization problems, to name a few. Efficiently preparing ground states for large, strongly correlated systems is a challenging task for both classical and quantum hardware. Drawing from classical optimization methods, e.g. dynamical optimization techniques, one may deduce the spectral decomposition in manner that avoids direct spectral decomposition and is amenable to Trotterization methods. An instance of the latter is ground state preparation by Imaginary Time Evolution (ITE), understood in physical terms as a natural cooling process. Its quantum version QITE (Quantum Imaginary Time Evolution) aims at implementing ITE in a quantum computer. In this paper we introduce a novel QITE algorithm, which leverages underlying geometric properties for algorithm-runtime and circuit depth reduction. This will materialize in the form of an iterative Line Search approach for minimization of energy as well as a Newton's method approach for the deduction of the optimal time-steps for each iteration of QITE. The depth-reduction will be carried out via approximating the resulting unitary operator estimated from the QITE algorithm with unitary operator which is an element of a one-parameter group; making expressible as a single unitary in a quantum circuit. Furthermore, we perform a numerical study to stablish the scaling of fidelities with the different truncation parameters and give gate counts estimates for each.
