Improving the variational quantum eigensolver using variational adiabatic quantum computing

Abstract

The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm for finding the minimum eigenvalue of a Hamiltonian that involves the optimization of a parameterized quantum circuit. Since the resulting optimization problem is in general nonconvex, the method can converge to suboptimal parameter values which do not yield the minimum eigenvalue. In this work, we address this shortcoming by adopting the concept of variational adiabatic quantum computing (VAQC) as a procedure to improve VQE. In VAQC, the ground state of a continuously parameterized Hamiltonian is approximated via a parameterized quantum circuit. We discuss some basic theory of VAQC to motivate the development of a hybrid quantum-classical homotopy continuation method. The proposed method has parallels with a predictor-corrector method for numerical integration of differential equations. While there are theoretical limitations to the procedure, we see in practice that VAQC can successfully find good initial circuit parameters to initialize VQE. We demonstrate this with two examples from quantum chemistry. Through these examples, we provide empirical evidence that VAQC, combined with other techniques (an adaptive termination criteria for the classical optimizer and a variance-based resampling method for the expectation evaluation), can provide more accurate solutions than "plain" VQE, for the same amount of effort.

arXiv comment21 pages, 5 figures

References in corpus (27)

• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Barren plateaus in quantum neural network training landscapes
• The theory of variational hybrid quantum-classical algorithms
• A Quantum Approximate Optimization Algorithm
• Adiabatic Quantum Computing
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Evaluating analytic gradients on quantum hardware
• Fermionic quantum computation
• Quantum optimization using variational algorithms on near-term quantum devices
• Variational ansatz-based quantum simulation of imaginary time evolution
• The Bravyi-Kitaev transformation for quantum computation of electronic structure
• Theory of variational quantum simulation
• Bounds for the adiabatic approximation with applications to quantum computation
• Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
• Warm-starting quantum optimization
• Tapering off qubits to simulate fermionic Hamiltonians
• Sequential minimal optimization for quantum-classical hybrid algorithms
• Performance of hybrid quantum/classical variational heuristics for combinatorial optimization
• Classical Optimizers for Noisy Intermediate-Scale Quantum Devices
• Gradients of parameterized quantum gates using the parameter-shift rule and gate decomposition
• The Meta-Variational Quantum Eigensolver (Meta-VQE): Learning energy profiles of parameterized Hamiltonians for quantum simulation
• Theory of analytical energy derivatives for the variational quantum eigensolver
• Demonstration of Adiabatic Variational Quantum Computing with a Superconducting Quantum Coprocessor
• Generalization of the output of variational quantum eigensolver by parameter interpolation with low-depth ansatz
• Addressing hard classical problems with Adiabatically Assisted Variational Quantum Eigensolvers
• Variationally Scheduled Quantum Simulation

Cited by in corpus (9)

• Quantum variational optimization: The role of entanglement and problem hardness
• Quantum phase detection generalisation from marginal quantum neural network models
• Variational quantum simulation: a case study for understanding warm starts
• Finite-size criticality in fully connected spin models on superconducting quantum hardware
• A hybrid quantum algorithm to detect conical intersections
• Hermitian-preserving ansatz and variational open quantum eigensolver
• Adiabatic quantum computing with parameterized quantum circuits
• Perturbation theory, irrep truncations, and state preparation methods for quantum simulations of SU(3) lattice gauge theory
• Benincasa-Dowker-Glaser causal set actions by quantum counting