|
|
Acevedo, A., Almudever, C. G., Garcia-March, M. A., Gomez-Lurbe, R., Ion, L., Lal Bera, M., et al. (2026). Adaptive time compressed QITE (ACQ) and its geometrical interpretation. Quantum Sci. Technol., 11(3), 035009–25pp.
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 CPN. Recalling that ITE is a gradient flow on the complex projective plane CPN, 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.
|
|
|
|
Gomez-Lurbe, R. (2026). Efficient protocol to estimate the Quantum Fisher Information Matrix for commuting-block circuits. Quantum Inf. Process., 25(9), 278–16pp.
Abstract: The Quantum Fisher Information Matrix (QFIM) quantifies how sensitive parameterized quantum states are to changes in their parameters. Recently, it has been used to improve variational quantum algorithm optimization through geometry-aware techniques. However, estimating the QFIM-particularly its off-block-diagonal elements-requires substantial resources. To address this, we introduce a novel protocol that efficiently computes these elements for commuting-block variational circuits. Our approach reduces the number of quantum state preparations from O(m2) to O(L2) , where m is the number of parameters and L the number of circuit layers. This also lowers classical measurement and post-processing requirements, improving computational efficiency.
|
|