Sequential minimal optimization for quantum-classical hybrid algorithms

Abstract

We propose a sequential minimal optimization method for quantum-classical hybrid algorithms, which converges faster, is robust against statistical error, and is hyperparameter-free. Specifically, the optimization problem of the parameterized quantum circuits is divided into solvable subproblems by considering only a subset of the parameters. In fact, if we choose a single parameter, the cost function becomes a simple sine curve with period $2\pi$, and hence we can exactly minimize with respect to the chosen parameter. Furthermore, even in general cases, the cost function is given by a simple sum of trigonometric functions with certain periods and hence can be minimized by using a classical computer. By repeatedly performing this procedure, we can optimize the parameterized quantum circuits so that the cost function becomes as small as possible. We perform numerical simulations and compare the proposed method with existing gradient-free and gradient-based optimization algorithms. We find that the proposed method substantially outperforms the existing optimization algorithms and converges to a solution almost independent of the initial choice of the parameters. This accelerates almost all quantum-classical hybrid algorithms readily and would be a key tool for harnessing near-term quantum devices.

arXiv comment11 pages, 4 figures

References in corpus (14)

• Quantum Machine Learning
• 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
• Quantum Circuit Learning
• Characterizing Quantum Supremacy in Near-Term Devices
• Parameterized quantum circuits as machine learning models
• A class of quantum many-body states that can be efficiently simulated
• Quantum generative adversarial networks
• Variational Quantum Computation of Excited States
• Subspace-search variational quantum eigensolver for excited states
• Hybrid Quantum-Classical Approach to Quantum Optimal Control
• Hybrid quantum-classical approach to correlated materials
• Quantum Variational Autoencoder

Cited by in corpus (95)

• Variational Quantum Algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• The Variational Quantum Eigensolver: a review of methods and best practices
• Layerwise learning for quantum neural networks
• General parameter-shift rules for quantum gradients
• Structure optimization for parameterized quantum circuits
• Real- and imaginary-time evolution with compressed quantum circuits
• Strategies for solving the Fermi-Hubbard model on near-term quantum computers
• Hardware-efficient variational quantum algorithms for time evolution
• Avoiding local minima in variational quantum eigensolvers with the natural gradient optimizer
• Equivalence of quantum barren plateaus to cost concentration and narrow gorges
• Variational Quantum State Eigensolver
• An Adaptive Optimizer for Measurement-Frugal Variational Algorithms
• Performance comparison of optimization methods on variational quantum algorithms
• A comprehensive review of Quantum Machine Learning: from NISQ to Fault Tolerance
• Layer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quantum Computers
• Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
• Efficient evaluation of quantum observables using entangled measurements
• Subspace Variational Quantum Simulator
• Benchmarking of Different Optimizers in the Variational Quantum Algorithms for Applications in Quantum Chemistry
• Quantum Analytic Descent
• Robust resource-efficient quantum variational ansatz through evolutionary algorithm
• Variational Quantum Algorithm for Non-equilibrium Steady States
• Variational quantum amplitude estimation
• Absence of barren plateaus in finite local-depth circuits with long-range entanglement
• Quantum dynamics simulations beyond the coherence time on NISQ hardware by variational Trotter compression
• Optimizing quantum circuits with Riemannian gradient flow
• Non-trivial symmetries in quantum landscapes and their resilience to quantum noise
• A semi-agnostic ansatz with variable structure for quantum machine learning
• Stochastic Gradient Line Bayesian Optimization for Efficient Noise-Robust Optimization of Parameterized Quantum Circuits
• Strategies for the Determination of the Running Coupling of $(2+1)$-dimensional QED with Quantum Computing
• A Performance Study of Variational Quantum Algorithms for Solving the Poisson Equation on a Quantum Computer
• Improving the variational quantum eigensolver using variational adiabatic quantum computing
• Simulating Time Evolution with Fully Optimized Single-Qubit Gates on Parameterized Quantum Circuits
• Efficient variational synthesis of quantum circuits with coherent multi-start optimization
• Quantum-Selected Configuration Interaction: classical diagonalization of Hamiltonians in subspaces selected by quantum computers
• An evolving objective function for improved variational quantum optimisation
• Comparative study of adaptive variational quantum eigensolvers for multi-orbital impurity models
• A diagrammatic approach to variational quantum ansatz construction
• Inference-Based Quantum Sensing
• Approximate encoding of quantum states using shallow circuits
• Here comes the SU(N): multivariate quantum gates and gradients
• Accelerated variational quantum eigensolver with joint Bell measurement
• Post-Hartree-Fock method in Quantum Chemistry for Quantum Computer
• A Variational Approach to the Quantum Separability Problem
• Variational Quantum Eigensolver for SU($N$) Fermions
• Scalable Quantum Simulations of Scattering in Scalar Field Theory on 120 Qubits
• Improved variational quantum eigensolver via quasi-dynamical evolution
• Unraveling correlated material properties with noisy quantum computers: Natural orbitalized variational quantum eigensolving of extended impurity models within a slave-boson approach
• Jarzynski-like Equality of Nonequilibrium Information Production Based on Quantum Cross Entropy
• Analyzing variational quantum landscapes with information content
• Automatic quantum circuit encoding of a given arbitrary quantum state
• Studying the phase diagram of the three-flavor Schwinger model in the presence of a chemical potential with measurement- and gate-based quantum computing
• Time Evolution of Uniform Sequential Circuits
• Demonstration of a bosonic quantum classifier with data re-uploading
• Solving an Industrially Relevant Quantum Chemistry Problem on Quantum Hardware
• Variational Quantum Algorithms for Trace Distance and Fidelity Estimation
• Benchmarking the Variational Quantum Eigensolver using different quantum hardware
• Near-term Efficient Quantum Algorithms for Entanglement Analysis
• Sequential optimal selection of a single-qubit gate and its relation to barren plateau in parameterized quantum circuits
• Efficient and Robust Parameter Optimization of the Unitary Coupled-Cluster Ansatz
• Resource frugal optimizer for quantum machine learning
• Variational quantum algorithm for generalized eigenvalue problems and its application to the finite element method
• Enhancing VQE Convergence for Optimization Problems with Problem-specific Parameterized Quantum Circuits
• Accurate and precise quantum computation of valence two-neutron systems
• Digital-analog quantum learning on Rydberg atom arrays
• Optimal Parameter Configurations for Sequential Optimization of Variational Quantum Eigensolver
• Information flow in parameterized quantum circuits
• Exponential Qubit Reduction in Optimization for Financial Transaction Settlement
• Calculating the Green's function of two-site Fermionic Hubbard model in a photonic system
• Fast gradient-free optimization of excitations in variational quantum eigensolvers
• Demonstrating Quantum Computation for Quasiparticle Band Structures
• Variational measurement-based quantum computation for generative modeling
• Greedy Gradient-free Adaptive Variational Quantum Algorithms on a Noisy Intermediate Scale Quantum Computer
• BBQ-mIS: a parallel quantum algorithm for graph coloring problems
• Universal noise-precision relations in variational quantum algorithms
• Scalability Challenges in Variational Quantum Optimization under Stochastic Noise
• Sequence of penalties method to study excited states using VQE
• Comparative study on compact quantum circuits of hybrid quantum-classical algorithms for quantum impurity models
• A Monte Carlo Tree Search approach to QAOA: finding a needle in the haystack
• Parent Hamiltonian as a benchmark problem for variational quantum eigensolvers
• VQE-generated quantum circuit dataset for machine learning
• Utility of NISQ devices: optimizing experimental parameters for the fabrication of Au atomic junction using gate-based quantum computers
• Bridging Quantum Computing and Nuclear Structure: Atomic Nuclei on a Trapped-Ion Quantum Computer
• Variational quantum algorithm based on Lagrange polynomial encoding to solve differential equations
• Batched Line Search Strategy for Navigating through Barren Plateaus in Quantum Circuit Training
• OnionVQE Optimization Strategy for Ground State Preparation on NISQ Devices
• Efficient Estimation and Sequential Optimization of Cost Functions in Variational Quantum Algorithms
• Quantum feature-map learning with reduced resource overhead
• Molecular resonance identification in complex absorbing potentials via integrated quantum computing and high-throughput computing
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions
• Topological and geometric patterns in optimal bang-bang protocols for variational quantum algorithms: application to the $XXZ$ model on the square lattice
• Interpolation-based coordinate descent method for parameterized quantum circuits
• Extended parameter shift rules with minimal derivative variance for parameterized quantum circuits
• (2+1)D quantum electrodynamics at finite density on a quantum computer