ADAPT-VQE is insensitive to rough parameter landscapes and barren plateaus

Abstract

Variational quantum eigensolvers (VQEs) represent a powerful class of hybrid quantum-classical algorithms for computing molecular energies. Various numerical issues exist for these methods, however, including barren plateaus and large numbers of local minima. In this work, we consider Adaptive, Problem-Tailored (ADAPT)-VQE ansätze, and examine how they are impacted by these local minima. We find that while ADAPT-VQE does not remove local minima, the gradient-informed, one-operator-at-a-time circuit construction seems to accomplish two things: First, it provides an initialization strategy that is dramatically better than random initialization, and which is applicable in situations where chemical intuition cannot help with initialization, i.e., when Hartree-Fock is a poor approximation to the ground state. Second, even if an ADAPT-VQE iteration converges to a local trap at one step, it can still "burrow" toward the exact solution by adding more operators, which preferentially deepens the occupied trap. This same mechanism helps highlight a surprising feature of ADAPT-VQE: It should not suffer optimization problems due to "barren plateaus". Even if barren plateaus appear in the parameter landscape, our analysis and simulations reveal that ADAPT-VQE avoids such regions by design.

References in corpus (6)

• Variational Quantum Algorithms
• Simulated Quantum Computation of Molecular Energies
• The Variational Quantum Eigensolver: a review of methods and best practices
• Training variational quantum algorithms is NP-hard
• Equivalence of quantum barren plateaus to cost concentration and narrow gorges
• Searching for quantum optimal controls under severe constraints

Cited by in corpus (43)

• Barren Plateaus in Variational Quantum Computing
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits
• Theoretical Guarantees for Permutation-Equivariant Quantum Neural Networks
• Does provable absence of barren plateaus imply classical simulability?
• Overlap-ADAPT-VQE: Practical Quantum Chemistry on Quantum Computers via Overlap-Guided Compact Ansätze
• TETRIS-ADAPT-VQE: An adaptive algorithm that yields shallower, denser circuit ansätze
• Absence of barren plateaus in finite local-depth circuits with long-range entanglement
• Quantifying the effect of gate errors on variational quantum eigensolvers for quantum chemistry
• Folded Spectrum VQE : A quantum computing method for the calculation of molecular excited states
• Variational quantum simulation: a case study for understanding warm starts
• Prediction of the neutron drip line in oxygen isotopes using quantum computation
• Efficient variational synthesis of quantum circuits with coherent multi-start optimization
• Training variational quantum algorithms with random gate activation
• Molecular Quantum Circuit Design: A Graph-Based Approach
• Using Differential Evolution to avoid local minima in Variational Quantum Algorithms
• Evaluating a quantum-classical quantum Monte Carlo algorithm with Matchgate shadows
• Quantum algorithms for scientific computing
• EHA: Entanglement-variational Hardware-efficient Ansatz for Eigensolvers
• Reducing the Resources Required by ADAPT-VQE Using Coupled Exchange Operators and Improved Subroutines
• Dynamic-ADAPT-QAOA: An algorithm with shallow and noise-resilient circuits
• Physically motivated improvements of Variational Quantum Eigensolvers
• Characterization of variational quantum algorithms using free fermions
• Layering and subpool exploration for adaptive Variational Quantum Eigensolvers: Reducing circuit depth, runtime, and susceptibility to noise
• Towards Efficient Quantum Computing for Quantum Chemistry: Reducing Circuit Complexity with Transcorrelated and Adaptive Ansatz Techniques
• Classical Pre-optimization Approach for ADAPT-VQE: Maximizing the Potential of High-Performance Computing Resources to Improve Quantum Simulation of Chemical Applications
• Applicability of Measurement-based Quantum Computation towards Physically-driven Variational Quantum Eigensolver
• Simulator Demonstration of Large Scale Variational Quantum Algorithm on HPC Cluster
• SHARC-VQE: Simplified Hamiltonian Approach with Refinement and Correction enabled Variational Quantum Eigensolver for Molecular Simulation
• Greedy Gradient-free Adaptive Variational Quantum Algorithms on a Noisy Intermediate Scale Quantum Computer
• Energy Landscape Plummeting in Variational Quantum Eigensolver: Subspace Optimization, Non-iterative Corrections and Generator-informed Initialization for Improved Quantum Efficiency
• Non-Iterative Disentangled Unitary Coupled-Cluster based on Lie-algebraic structure
• Hamiltonian Forging of a Thermofield Double
• Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms
• Limitations of Quantum Hardware for Molecular Energy Estimation Using VQE
• Expressivity of deterministic quantum computation with one qubit
• Counterdiabatic ADAPT-VQE for molecular simulation
• Double descent in quantum kernel methods
• Multi-channel convolutional neural quantum embedding
• Mitigating the measurement overhead of ADAPT-VQE with optimised informationally complete generalised measurements
• Learning complexity gradually in quantum machine learning models
• Quantum feature-map learning with reduced resource overhead
• Evaluating Ground State Energies of Chemical Systems with Low-Depth Quantum Circuits and High Accuracy
• Shot-Efficient ADAPT-VQE via Reused Pauli Measurements and Variance-Based Shot Allocation