Adaptive shot allocation for fast convergence in variational quantum algorithms
arXiv:2108.10434 · doi:10.48550/arXiv.2108.10434
Abstract
Variational Quantum Algorithms (VQAs) are a promising approach for practical applications like chemistry and materials science on near-term quantum computers as they typically reduce quantum resource requirements. However, in order to implement VQAs, an efficient classical optimization strategy is required. Here we present a new stochastic gradient descent method using an adaptive number of shots at each step, called the global Coupled Adaptive Number of Shots (gCANS) method, which improves on prior art in both the number of iterations as well as the number of shots required. These improvements reduce both the time and money required to run VQAs on current cloud platforms. We analytically prove that in a convex setting gCANS achieves geometric convergence to the optimum. Further, we numerically investigate the performance of gCANS on some chemical configuration problems. We also consider finding the ground state for an Ising model with different numbers of spins to examine the scaling of the method. We find that for these problems, gCANS compares favorably to all of the other optimizers we consider.
arXiv comment13 pages, 6 figures, 1 table
References in corpus (33)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- A variational eigenvalue solver on a quantum processor
- Barren plateaus in quantum neural network training landscapes
- A Quantum Approximate Optimization Algorithm
- Quantum Circuit Learning
- Evaluating analytic gradients on quantum hardware
- Noise-Induced Barren Plateaus in Variational Quantum Algorithms
- Towards Practical Quantum Variational Algorithms
- Connecting ansatz expressibility to gradient magnitudes and barren plateaus
- Quantum-assisted quantum compiling
- Absence of Barren Plateaus in Quantum Convolutional Neural Networks
- Variational quantum simulation of general processes
- Variational Fast Forwarding for Quantum Simulation Beyond the Coherence Time
- Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
- Variational Quantum State Diagonalization
- Variational Quantum Linear Solver
- Tapering off qubits to simulate fermionic Hamiltonians
- Variational algorithms for linear algebra
- Trainability of Dissipative Perceptron-Based Quantum Neural Networks
- Equivalence of quantum barren plateaus to cost concentration and narrow gorges
- Barren plateaus preclude learning scramblers
- Higher Order Derivatives of Quantum Neural Networks with Barren Plateaus
- Low-depth gradient measurements can improve convergence in variational hybrid quantum-classical algorithms
- Classical Optimizers for Noisy Intermediate-Scale Quantum Devices
- Variational Quantum Algorithm for Estimating the Quantum Fisher Information
- Variational Consistent Histories as a Hybrid Algorithm for Quantum Foundations
- Near-term quantum algorithms for linear systems of equations
- Measurement cost of metric-aware variational quantum algorithms
- Variational Hamiltonian Diagonalization for Dynamical Quantum Simulation
- Quantum Analytic Descent
- Operator Sampling for Shot-frugal Optimization in Variational Algorithms
- Sub-Quantum Fisher Information
- A Jacobi Diagonalization and Anderson Acceleration Algorithm For Variational Quantum Algorithm Parameter Optimization