• Corpus ID: 246485465

An Empirical Review of Optimization Techniques for Quantum Variational Circuits

  title={An Empirical Review of Optimization Techniques for Quantum Variational Circuits},
  author={Owen Lockwood},
  • Owen Lockwood
  • Published 3 February 2022
  • Computer Science, Physics
  • ArXiv
Quantum Variational Circuits (QVCs) are often claimed as one of the most potent uses of both near term and long term quantum hardware. The standard approaches to optimizing these circuits rely on a classical system to compute the new parameters at every optimization step. However, this process can be extremely challenging, due to the nature of navigating the exponentially scaling complex Hilbert space, barren plateaus, and the noise present in all foreseeable quantum hardware. Although a… 

Figures and Tables from this paper

Efficient variational synthesis of quantum circuits with coherent multi-start optimization
This work considers the problem of the variational quantum circuit synthesis into a gate set consisting of the CNOT gate and arbitrary single-qubit (1q) gates and proposes a coherent optimization of the architecture together with 1q gates which appears to work surprisingly well in practice.
Characterization of variational quantum algorithms using free fermions
Gabriel Matos, Chris N. Self, Zlatko Papić, Konstantinos Meichanetzidis, and Henrik Dreyer School of Physics and Astronomy, University of Leeds, Leeds LS2 9JT, United Kingdom Quantinuum, Partnership
Meta-Learning Digitized-Counterdiabatic Quantum Optimization
Pranav Chandarana,1, 2, ∗ Pablo S. Vieites,1, ∗ Narendra N. Hegade,3 Enrique Solano,3, 4, 5 Yue Ban,1, 2, 6 and Xi Chen1, 2, † 1Department of Physical Chemistry, University of the Basque Country
An Empirical Review of Model-based Adaptive Sampling for Global Optimization of Expensive Black-box Functions
The importance of dynamic discretization for distance-based exploration and an improved variant of a previously proposed Pareto-based sampling technique are emphasized and the effectiveness of variance-based techniques for algorithm design anddistance-based methods for engineering design optimization problems are revealed.
Stochastic optimization algorithms for quantum applications
J. A. Gidi,1, ∗ B. Candia,1, 2 A. D. Muñoz-Moller,1, 2 A. Rojas,1, 2 L. Pereira,3 M. Muñoz,4, 5 L. Zambrano,1, 2 and A. Delgado1, 2 Departamento de Física, Facultad de Ciencias Físicas y Matemáticas,


Using models to improve optimizers for variational quantum algorithms
This work introduces two optimization methods and numerically compares their performance with common methods in use today, and develops experimentally relevant cost models designed to balance efficiency in testing and accuracy with respect to cloud quantum computing systems.
Barren plateaus in quantum neural network training landscapes
It is shown that for a wide class of reasonable parameterized quantum circuits, the probability that the gradient along any reasonable direction is non-zero to some fixed precision is exponentially small as a function of the number of qubits.
Evaluating analytic gradients on quantum hardware
This paper shows how gradients of expectation values of quantum measurements can be estimated using the same, or almost the same the architecture that executes the original circuit, and proposes recipes for the computation of gradients for continuous-variable circuits.
Performance comparison of optimization methods on variational quantum algorithms
This work studies the performance of four commonly used gradient-free optimization methods: SLSQP, COBYLA, CMA-ES, and SPSA, at finding ground-state energies of a range of small chemistry and material science problems and investigates the ability of an optimizer to beat the ‘sampling noise floor’.
Classical Optimizers for Noisy Intermediate-Scale Quantum Devices
We present a collection of optimizers tuned for usage on Noisy Intermediate-Scale Quantum (NISQ) devices. Optimizers have a range of applications in quantum computing, including the Variational
Variational Quantum Algorithms
An overview of the field of Variational Quantum Algorithms is presented and strategies to overcome their challenges as well as the exciting prospects for using them as a means to obtain quantum advantage are discussed.
General parameter-shift rules for quantum gradients
This work derives new, general parameter-shift rules for single-parameter gates, and provides closed-form expressions to apply them, which are then extended to multi- parametrized quantum gates by combining them with the stochastic parameter- shift rule.
Training Variational Quantum Algorithms Is NP-Hard.
This work shows that the training landscape can have many far from optimal persistent local minima, which means gradient and higher order descent algorithms will generally converge to farFrom optimal solutions.
Noisy intermediate-scale quantum (NISQ) algorithms
A thorough summary of NISQ computational paradigms and algorithms, which discusses the key structure of these algorithms, their limitations, and advantages, and a comprehensive overview of various benchmarking and software tools useful for programming and testing NISZ devices.
Optimizing Quantum Variational Circuits with Deep Reinforcement Learning
It is found that reinforcement learning augmented optimizers consistently outperform gradient descent in noisy environments.