Double-bracket quantum algorithms for quantum imaginary-time evolution

Abstract

Efficiently preparing approximate ground-states of large, strongly correlated systems on quantum hardware is challenging and yet nature is innately adept at this. This has motivated the study of thermodynamically inspired approaches to ground-state preparation that aim to replicate cooling processes via imaginary-time evolution. However, synthesizing quantum circuits that efficiently implement imaginary-time evolution is itself difficult, with prior proposals generally adopting heuristic variational approaches or using deep block encodings. Here, we use the insight that quantum imaginary-time evolution is a solution of Brockett's double-bracket flow and synthesize circuits that implement double-bracket flows coherently on the quantum computer. We prove that our Double-Bracket Quantum Imaginary-Time Evolution (DB-QITE) algorithm inherits the cooling guarantees of imaginary-time evolution. Concretely, each step is guaranteed to i) decrease the energy of an initial approximate ground-state by an amount proportion to the energy fluctuations of the initial state and ii) increase the fidelity with the ground-state. We provide gate counts for DB-QITE through numerical simulations in Qrisp which demonstrate scenarios where DB-QITE outperforms quantum phase estimation. Thus DB-QITE provides a means to systematically improve the approximation of a ground-state using shallow circuits.

References in corpus (24)

• Simulating Hamiltonian dynamics with a truncated Taylor series
• A Review on Quantum Approximate Optimization Algorithm and its Variants
• Barren Plateaus in Variational Quantum Computing
• The power of quantum systems on a line
• Entropy and Entanglement in Quantum Ground States
• Preparation of matrix product states with log-depth quantum circuits
• Chemistry Beyond the Scale of Exact Diagonalization on a Quantum-Centric Supercomputer
• Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
• Efficient step-merged quantum imaginary time evolution algorithm for quantum chemistry
• Does provable absence of barren plateaus imply classical simulability?
• Exact Diagonalization of Heisenberg SU(N) models
• Unifying variational methods for simulating quantum many-body systems
• Single-ancilla ground state preparation via Lindbladians
• Constant-depth preparation of matrix product states with adaptive quantum circuits
• Demonstrating Bayesian Quantum Phase Estimation with Quantum Error Detection
• Rapid initial state preparation for the quantum simulation of strongly correlated molecules
• Local minima in quantum systems
• Qibolab: an open-source hybrid quantum operating system
• Quantum Simulation of Realistic Materials in First Quantization Using Non-local Pseudopotentials
• Rise of conditionally clean ancillae for efficient quantum circuit constructions
• Phase-Sensitive Quantum Measurement without Controlled Operations
• Unraveling long-time quantum dynamics using flow equations
• Quantum Dynamic Programming
• Bang-bang algorithms for quantum many-body ground states: a tensor network exploration

Cited by in corpus (4)

• Double-Bracket Master Equations: Phase-Space Representation and Classical Limit
• Adaptive time Compressed QITE (ACQ) and its geometrical interpretation
• Quantum Imaginary-Time Evolution with Polynomial Resources in Evolution Time
• Double-bracket quantum algorithms for high-fidelity ground state preparation