Random coordinate descent: a simple alternative for optimizing parameterized quantum circuits
arXiv:2311.00088 · doi:10.1103/PhysRevResearch.6.033029
Abstract
Variational quantum algorithms rely on the optimization of parameterized quantum circuits in noisy settings. The commonly used back-propagation procedure in classical machine learning is not directly applicable in this setting due to the collapse of quantum states after measurements. Thus, gradient estimations constitute a significant overhead in a gradient-based optimization of such quantum circuits. This paper introduces a random coordinate descent algorithm as a practical and easy-to-implement alternative to the full gradient descent algorithm. This algorithm only requires one partial derivative at each iteration. Motivated by the behavior of measurement noise in the practical optimization of parameterized quantum circuits, this paper presents an optimization problem setting that is amenable to analysis. Under this setting, the random coordinate descent algorithm exhibits the same level of stochastic stability as the full gradient approach, making it as resilient to noise. The complexity of the random coordinate descent method is generally no worse than that of the gradient descent and can be much better for various quantum optimization problems with anisotropic Lipschitz constants. Theoretical analysis and extensive numerical experiments validate our findings.
References in corpus (45)
- Array Programming with NumPy
- Quantum Machine Learning
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Ising formulations of many NP problems
- Barren plateaus in quantum neural network training landscapes
- The theory of variational hybrid quantum-classical algorithms
- Entanglement spectrum of a topological phase in one dimension
- An introduction to quantum machine learning
- Parameterized quantum circuits as machine learning models
- Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
- Challenges and Opportunities in Quantum Machine Learning
- Quantum optimization using variational algorithms on near-term quantum devices
- Practical Quantum Error Mitigation for Near-Future Applications
- Hybrid quantum-classical algorithms and quantum error mitigation
- Quantum Natural Gradient
- Theory of variational quantum simulation
- Layerwise learning for quantum neural networks
- Reinforcement Learning in Different Phases of Quantum Control
- Ground State Phase Diagram of S=1 XXZ Chains with Uniaxial Single-Ion-Type Anisotropy
- Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
- Training of Quantum Circuits on a Hybrid Quantum Computer
- Stochastic gradient descent for hybrid quantum-classical optimization
- Structure optimization for parameterized quantum circuits
- Theory of overparametrization in quantum neural networks
- Hardware-efficient variational quantum algorithms for time evolution
- Fast quantum algorithm for numerical gradient estimation
- Optimizing quantum optimization algorithms via faster quantum gradient computation
- Measuring Analytic Gradients of General Quantum Evolution with the Stochastic Parameter Shift Rule
- Mitigating realistic noise in practical noisy intermediate-scale quantum devices
- Reinforcement Learning for Many-Body Ground-State Preparation Inspired by Counterdiabatic Driving
- Generalized quantum subspace expansion
- Automatic design of quantum feature maps
- Reinforcement learning for autonomous preparation of Floquet-engineered states: Inverting the quantum Kapitza oscillator
- Using models to improve optimizers for variational quantum algorithms
- Quantum variational optimization: The role of entanglement and problem hardness
- Noise-Resilient Variational Hybrid Quantum-Classical Optimization
- Can Error Mitigation Improve Trainability of Noisy Variational Quantum Algorithms?
- Natural Evolutionary Strategies for Variational Quantum Computation
- Ground-state fidelity of the spin-1 Heisenberg chain with single ion anisotropy: quantum renormalization group and exact diagonalization approaches
- Stochastic Gradient Line Bayesian Optimization for Efficient Noise-Robust Optimization of Parameterized Quantum Circuits
- Galaxy morphoto-Z with neural Networks (GaZNets). I. Optimized accuracy and outlier fraction from Imaging and Photometry
- Natural evolution strategies and variational Monte Carlo
- Quantum Gradient Algorithm for General Polynomials
Cited by in corpus (4)
- Accelerating quantum imaginary-time evolution with random measurements
- Backpropagation scaling in parameterised quantum circuits
- Extended parameter shift rules with minimal derivative variance for parameterized quantum circuits
- Interpolation-based coordinate descent method for parameterized quantum circuits