Interpolation-based coordinate descent method for parameterized quantum circuits

Abstract

Parameterized quantum circuits (PQCs) are ubiquitous in the design of hybrid quantum-classical algorithms. In this work, we propose an interpolation-based coordinate descent (ICD) method to address the parameter optimization problem in PQCs. The ICD method provides a unified framework for existing structure optimization techniques such as Rotosolve, sequential minimal optimization, ExcitationSolve, and others. ICD employs interpolation to approximate the PQC cost function, effectively recovering its underlying trigonometric structure, and then performs an argmin update on a single parameter in each iteration. In contrast to previous studies on structure optimization, we determine the optimal interpolation nodes to mitigate statistical errors arising from quantum measurements. Moreover, in the common case of $r$ equidistant frequencies, we show that the optimal interpolation nodes are equidistant nodes with spacing $2\pi /(2r+1)$ (under constant variance assumption), and that our ICD method simultaneously minimizes the mean squared error, the condition number of the interpolation matrix, and the average variance of the approximated cost function. We perform numerical simulations and test on the MaxCut problem, the transverse field Ising model, and the XXZ model. Numerical results imply that our ICD method is more efficient than the commonly used gradient descent and random coordinate descent method.

29+20 pages, 13 figures

References in corpus (39)

• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Supervised learning with quantum enhanced feature spaces
• Barren plateaus in quantum neural network training landscapes
• Quantum machine learning in feature Hilbert spaces
• Parameterized quantum circuits as machine learning models
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Circuit-centric quantum classifiers
• Data re-uploading for a universal quantum classifier
• Variational ansatz-based quantum simulation of imaginary time evolution
• Quantum Natural Gradient
• Theory of variational quantum simulation
• Training variational quantum algorithms is NP-hard
• Continuous-variable quantum neural networks
• A Review on Quantum Approximate Optimization Algorithm and its Variants
• Opportunities and challenges for quantum-assisted machine learning in near-term quantum computers
• Variational quantum simulation of general processes
• Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
• Barren Plateaus in Variational Quantum Computing
• Stochastic gradient descent for hybrid quantum-classical optimization
• Structure optimization for parameterized quantum circuits
• Sequential minimal optimization for quantum-classical hybrid algorithms
• Estimating the gradient and higher-order derivatives on quantum hardware
• Equivalence of quantum barren plateaus to cost concentration and narrow gorges
• A Comparison of Various Classical Optimizers for a Variational Quantum Linear Solver
• Gradients of parameterized quantum gates using the parameter-shift rule and gate decomposition
• A Primer on Coordinate Descent Algorithms
• Classical surrogates for quantum learning models
• Fourier expansion in variational quantum algorithms
• Classification of dynamical Lie algebras for translation-invariant 2-local spin systems in one dimension
• Schrödinger-Heisenberg Variational Quantum Algorithms
• An introduction to variational quantum algorithms for combinatorial optimization problems
• Variational approach to photonic quantum circuits via the parameter shift rule
• Random coordinate descent: a simple alternative for optimizing parameterized quantum circuits
• Fast gradient-free optimization of excitations in variational quantum eigensolvers
• An Empirical Review of Optimization Techniques for Quantum Variational Circuits
• Connecting the Hamiltonian structure to the QAOA energy and Fourier landscape structure
• Efficient recovery of variational quantum algorithms landscapes using classical signal processing
• Fourier Analysis of Parameterized Quantum Circuits and the Barren Plateau Problem