Dual-VQE: A quantum algorithm to lower bound the ground-state energy
arXiv:2312.03083 · doi:10.1103/twrt-y691
Abstract
The variational quantum eigensolver (VQE) is a hybrid quantum-classical variational algorithm that produces an upper-bound estimate of the ground-state energy of a Hamiltonian. As quantum computers become more powerful and go beyond the reach of classical brute-force simulation, it is important to assess the quality of solutions produced by them. Here we propose a dual variational quantum eigensolver (dual-VQE) that produces a lower-bound estimate of the ground-state energy. As such, VQE and dual-VQE can serve as quality checks on their solutions; in the ideal case, the VQE upper bound and the dual-VQE lower bound form an interval containing the true optimal value of the ground-state energy. The idea behind dual-VQE is to employ semidefinite programming duality to rewrite the ground-state optimization problem as a constrained maximization problem, which itself can be bounded from below by an unconstrained optimization problem to be solved by a variational quantum algorithm. When using a convex combination ansatz in conjunction with a classical generative model, the quantum computational resources needed to evaluate the objective function of dual-VQE are no greater than those needed for that of VQE. We also show that the problem is well suited for classical pretraining using matrix product states and these methods help warm-start the optimization. We simulated the performance of dual-VQE on the transverse-field Ising model with and without pretraining and found that, for the example considered, while dual-VQE training is slower and noisier than VQE, it approaches the true value with an error of order .
v3: 15 pages, 8 figures, accepted for publication in Physical Review A
References in corpus (31)
- A variational eigenvalue solver on a quantum processor
- The density-matrix renormalization group in the age of matrix product states
- Variational Quantum Algorithms
- Barren plateaus in quantum neural network training landscapes
- A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
- Noisy intermediate-scale quantum (NISQ) algorithms
- Quantum Circuit Learning
- Evaluating analytic gradients on quantum hardware
- Matrix Product States and Projected Entangled Pair States: Concepts, Symmetries, and Theorems
- A generative modeling approach for benchmarking and training shallow quantum circuits
- Towards Quantum Machine Learning with Tensor Networks
- Hybrid Quantum-Classical Approach to Quantum Optimal Control
- The SWAP test and the Hong-Ou-Mandel effect are equivalent
- Equivalence of quantum barren plateaus to cost concentration and narrow gorges
- A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits
- Encoding of Matrix Product States into Quantum Circuits of One- and Two-Qubit Gates
- A mathematical and computational review of Hartree-Fock SCF methods in Quantum Chemistry
- Does provable absence of barren plateaus imply classical simulability?
- The Meta-Variational Quantum Eigensolver (Meta-VQE): Learning energy profiles of parameterized Hamiltonians for quantum simulation
- Semidefinite Programming in Quantum Information Science
- The Adjoint Is All You Need: Characterizing Barren Plateaus in Quantum Ansätze
- Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage
- Solving condensed-matter ground-state problems by semidefinite relaxations
- Noisy intermediate-scale quantum algorithm for semidefinite programming
- Quantum Mixed State Compiling
- Neural network encoded variational quantum algorithms
- Quantum algorithms for training Gaussian Processes
- Tensor networks for quantum computing
- Variational Quantum Algorithms for Semidefinite Programming
- QSlack: A slack-variable approach for variational quantum semi-definite programming
- Efficient quantum algorithms for testing symmetries of open quantum systems