Double-bracket quantum algorithms for high-fidelity ground state preparation

Abstract

Ground state preparation is a central application for quantum computers but remains challenging in practice. In this work, we quantitatively investigate the performance and gate counts of double-bracket quantum algorithms (DBQAs) for ground state preparation. We propose a practical strategy in which DBQAs refine initial state preparation circuits, and we compile them for Heisenberg chains using controlled-Z and single-qubit gates. Warm-started DBQAs consistently improve both the energy and ground-state fidelity relative to the initial states provided by variational ansätze, indicating that DBQAs offer an effective unitary synthesis method. To demonstrate compatibility with near-term hardware, we executed a proof-of-concept example on IBM devices. With error mitigation, we observed a statistically significant improvement over the corresponding warm-start circuit. Furthermore, numerical emulations for the same system size indicate that executing DBQAs on Quantinuum's hardware could achieve similar cost-function gains without requiring error mitigation. These findings suggest that DBQAs are a promising approach for enhancing ground-state approximations on near-term quantum devices.

11 pages + appendix, 5 figures, code available at: https://github.com/qiboteam/boostvqe

References in corpus (86)

• SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Barren plateaus in quantum neural network training landscapes
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum Circuit Learning
• Evaluating analytic gradients on quantum hardware
• The Variational Quantum Eigensolver: a review of methods and best practices
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Hartree-Fock on a superconducting qubit quantum computer
• Towards Practical Quantum Variational Algorithms
• Efficient quantum state tomography
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Self-Verifying Variational Quantum Simulation of the Lattice Schwinger Model
• Variational ansatz-based quantum simulation of imaginary time evolution
• Quantum Natural Gradient
• Training variational quantum algorithms is NP-hard
• A random compiler for fast Hamiltonian simulation
• Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
• Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• Barren Plateaus in Variational Quantum Computing
• Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
• Nearly optimal lattice simulation by product formulas
• Model-free readout-error mitigation for quantum expectation values
• Near-optimal ground state preparation
• Mitigating depolarizing noise on quantum computers with noise-estimation circuits
• Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
• Qibo: a framework for quantum simulation with hardware acceleration
• Orthogonality Catastrophe as a Consequence of the Quantum Speed Limit
• Early Fault-Tolerant Quantum Computing
• Quantum Vision Transformers
• Chemistry Beyond the Scale of Exact Diagonalization on a Quantum-Centric Supercomputer
• Adaptive Variational Quantum Imaginary Time Evolution Approach for Ground State Preparation
• Implementation of quantum imaginary-time evolution method on NISQ devices: Nonlocal approximation
• Does provable absence of barren plateaus imply classical simulability?
• Quantum computing of the ${}^6$Li nucleus via ordered unitary coupled clusters
• Exact Diagonalization of Heisenberg SU(N) models
• Hamiltonian variational ansatz without barren plateaus
• Lectures on the Bethe Ansatz
• Variational quantum eigensolver for the Heisenberg antiferromagnet on the kagome lattice
• Determining the proton content with a quantum computer
• Flow Equations and Normal Ordering. A Survey
• Initial state preparation for quantum chemistry on quantum computers
• Style-based quantum generative adversarial networks for Monte Carlo events
• Gradient Flows for Optimisation and Quantum Control: Foundations and Applications
• The Algebraic Bethe Ansatz and Tensor Networks
• Numerical Contraction of the Tensor Network generated by the Algebraic Bethe Ansatz
• Demonstrating Bayesian Quantum Phase Estimation with Quantum Error Detection
• Quantum anomaly detection in the latent space of proton collision events at the LHC
• Algebraic Bethe Circuits
• Optimizing quantum circuits with Riemannian gradient flow
• Rapid initial state preparation for the quantum simulation of strongly correlated molecules
• Efficient Product Formulas for Commutators and Applications to Quantum Simulation
• Quantum simulation with just-in-time compilation
• Diagonalization of large many-body Hamiltonians on a quantum processor
• Finite-size criticality in fully connected spin models on superconducting quantum hardware
• Product Formulas for Exponentials of Commutators
• Symmetry breaking in geometric quantum machine learning in the presence of noise
• An open-source modular framework for quantum computing
• The Bethe Ansatz as a Quantum Circuit
• Qibolab: an open-source hybrid quantum operating system
• Double-bracket quantum algorithms for diagonalization
• Trainability and Expressivity of Hamming-Weight Preserving Quantum Circuits for Machine Learning
• Long-lived Particles Anomaly Detection with Parametrized Quantum Circuits
• Quantum error mitigation for Fourier moment computation
• Improved approximation algorithms for bounded-degree local Hamiltonians
• Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation
• Multi-variable integration with a variational quantum circuit
• Loop Feynman integration on a quantum computer
• Characterization of a Transmon Qubit in a 3D Cavity for Quantum Machine Learning and Photon Counting
• Double-bracket quantum algorithms for quantum imaginary-time evolution
• Equivariant Variational Quantum Eigensolver to detect Phase Transitions through Energy Level Crossings
• Quantum Dynamic Programming
• Estimating Bethe roots with VQE
• Quantum encoder for fixed Hamming-weight subspaces
• Statistics of topological defects across a phase transition in a digital superconducting quantum processor
• Quantum noise modeling through Reinforcement Learning
• Dual-VQE: A quantum algorithm to lower bound the ground-state energy
• Double-bracket algorithm for quantum signal processing without post-selection
• Determining probability density functions with adiabatic quantum computing
• Toward scalable quantum computations of atomic nuclei
• Beyond asymptotic reasoning: the practicalities of a quantum ground state projector based on the wall-Chebyshev expansion