Adaptive time Compressed QITE (ACQ) and its geometrical interpretation

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 ${\mathbb{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.

References in corpus (25)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Probing many-body dynamics on a 51-atom quantum simulator
• Ising formulations of many NP problems
• Barren plateaus in quantum neural network training landscapes
• Quantum computational chemistry
• Matrix Product States and Projected Entangled Pair States: Concepts, Symmetries, and Theorems
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Synthesis of Quantum Logic Circuits
• Variational ansatz-based quantum simulation of imaginary time evolution
• Quantum Natural Gradient
• Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
• Barren Plateaus in Variational Quantum Computing
• Avoiding local minima in variational quantum eigensolvers with the natural gradient optimizer
• Average fidelity between random quantum states
• Geometry of variational methods: dynamics of closed quantum systems
• On the representation of Boolean and real functions as Hamiltonians for quantum computing
• Implementation of quantum imaginary-time evolution method on NISQ devices: Nonlocal approximation
• Topological Order from Measurements and Feed-Forward on a Trapped Ion Quantum Computer
• Efficient step-merged quantum imaginary time evolution algorithm for quantum chemistry
• Quantum natural gradient generalised to noisy and non-unitary circuits
• Improved algorithms of quantum imaginary time evolution for ground and excited states of molecular systems
• Accelerating quantum imaginary-time evolution with random measurements
• Double-bracket quantum algorithms for quantum imaginary-time evolution
• Quantum Natural Gradient optimizer on noisy platforms: QAOA as a case study