Using models to improve optimizers for variational quantum algorithms

Abstract

Variational quantum algorithms are a leading candidate for early applications on noisy intermediate-scale quantum computers. These algorithms depend on a classical optimization outer-loop that minimizes some function of a parameterized quantum circuit. In practice, finite sampling error and gate errors make this a stochastic optimization with unique challenges that must be addressed at the level of the optimizer. The sharp trade-off between precision and sampling time in conjunction with experimental constraints necessitates the development of new optimization strategies to minimize overall wall clock time in this setting. In this work, we introduce two optimization methods and numerically compare their performance with common methods in use today. The methods are surrogate model-based algorithms designed to improve reuse of collected data. They do so by utilizing a least-squares quadratic fit of sampled function values within a moving trusted region to estimate the gradient or a policy gradient. To make fair comparisons between optimization methods, we develop experimentally relevant cost models designed to balance efficiency in testing and accuracy with respect to cloud quantum computing systems. The results here underscore the need to both use relevant cost models and optimize hyperparameters of existing optimization methods for competitive performance. The methods introduced here have several practical advantages in realistic experimental settings, and we have used one of them successfully in a separately published experiment on Google's Sycamore device.

arXiv comment22 pages, 10 figures. Added Model Policy Gradient optimizer and changed title

References in corpus (23)

• SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A variational eigenvalue solver on a quantum processor
• Correlated Electrons in High Temperature Superconductors
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• The theory of variational hybrid quantum-classical algorithms
• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• Quantum Circuit Learning
• Evaluating analytic gradients on quantum hardware
• Towards Practical Quantum Variational Algorithms
• Self-Verifying Variational Quantum Simulation of the Lattice Schwinger Model
• Detecting arbitrary quantum errors via stabilizer measurements on a sublattice of the surface code
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• Quantum Natural Gradient
• Robust determination of molecular spectra on a quantum processor
• Quantum chemistry calculations on a trapped-ion quantum simulator
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
• Avoiding local minima in variational quantum eigensolvers with the natural gradient optimizer
• Performance of hybrid quantum/classical variational heuristics for combinatorial optimization
• An Adaptive Optimizer for Measurement-Frugal Variational Algorithms
• Classical Optimizers for Noisy Intermediate-Scale Quantum Devices

Cited by in corpus (40)

• The Variational Quantum Eigensolver: a review of methods and best practices
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• A Review on Quantum Approximate Optimization Algorithm and its Variants
• Fermionic partial tomography via classical shadows
• Performance comparison of optimization methods on variational quantum algorithms
• Observing ground-state properties of the Fermi-Hubbard model using a scalable algorithm on a quantum computer
• A Comparison of Various Classical Optimizers for a Variational Quantum Linear Solver
• A case study of variational quantum algorithms for a job shop scheduling problem
• Reinforcement Learning for Many-Body Ground-State Preparation Inspired by Counterdiabatic Driving
• Minimizing estimation runtime on noisy quantum computers
• Correlation-Informed Permutation of Qubits for Reducing Ansatz Depth in VQE
• Adaptive pruning-based optimization of parameterized quantum circuits
• Graph neural network initialisation of quantum approximate optimisation
• Qubit-efficient encoding schemes for binary optimisation problems
• Optimizing quantum circuits with Riemannian gradient flow
• Non-trivial symmetries in quantum landscapes and their resilience to quantum noise
• Real-Time Krylov Theory for Quantum Computing Algorithms
• Stochastic Gradient Line Bayesian Optimization for Efficient Noise-Robust Optimization of Parameterized Quantum Circuits
• A Variational Quantum Attack for AES-like Symmetric Cryptography
• Variational quantum algorithm with information sharing
• Quantum Approximate Optimization Algorithm pseudo-Boltzmann states
• Surrogate-based optimization for variational quantum algorithms
• Reinforcement Learning Assisted Recursive QAOA
• Latency considerations for stochastic optimizers in variational quantum algorithms
• Robustness of quantum algorithms against coherent control errors
• Certified variational quantum algorithms for eigenstate preparation
• Quantum Circuit Evolution on NISQ Devices
• A Parameter Setting Heuristic for the Quantum Alternating Operator Ansatz
• Analyzing variational quantum landscapes with information content
• Faster variational quantum algorithms with quantum kernel-based surrogate models
• Random coordinate descent: a simple alternative for optimizing parameterized quantum circuits
• Exploring the neighborhood of 1-layer QAOA with Instantaneous Quantum Polynomial circuits
• Connection between single-layer Quantum Approximate Optimization Algorithm interferometry and thermal distributions sampling
• Scalability Challenges in Variational Quantum Optimization under Stochastic Noise
• Thermal entanglement of superconducting qubits for arbitrary interaction strength
• Solving the Hubbard model using density matrix embedding theory and the variational quantum eigensolver
• End-to-End Protocol for High-Quality QAOA Parameters with Few Shots
• Encoding strongly-correlated many-boson wavefunctions on a photonic quantum computer: application to the attractive Bose-Hubbard model
• Quantum natural gradient with thermal-state initialization
• Efficient Online Quantum Circuit Learning with No Upfront Training