A Jacobi Diagonalization and Anderson Acceleration Algorithm For Variational Quantum Algorithm Parameter Optimization

Abstract

The optimization of circuit parameters of variational quantum algorithms such as the variational quantum eigensolver (VQE) or the quantum approximate optimization algorithm (QAOA) is a key challenge for the practical deployment of near-term quantum computing algorithms. Here, we develop a hybrid quantum/classical optimization procedure inspired by the Jacobi diagonalization algorithm for classical eigendecomposition, and combined with Anderson acceleration. In the first stage, analytical tomography fittings are performed for a local cluster of circuit parameters via sampling of the observable objective function at quadrature points in the circuit angles. Classical optimization is used to determine the optimal circuit parameters within the cluster, with the other circuit parameters frozen. Different clusters of circuit parameters are then optimized in "sweeps,'' leading to a monotonically-convergent fixed-point procedure. In the second stage, the iterative history of the fixed-point Jacobi procedure is used to accelerate the convergence by applying Anderson acceleration/Pulay's direct inversion of the iterative subspace (DIIS). This Jacobi+Anderson method is numerically tested using a quantum circuit simulator (without noise) for a representative test case from the multistate, contracted variant of the variational quantum eigensolver (MC-VQE), and is found to be competitive with and often faster than Powell's method and L-BFGS.

31 pages, 16 figures

Cited by in corpus (14)

• 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
• Strategies for solving the Fermi-Hubbard model on near-term quantum computers
• Equivalence of quantum barren plateaus to cost concentration and narrow gorges
• Variational Quantum State Eigensolver
• Variational quantum amplitude estimation
• Preserving Symmetries for Variational Quantum Eigensolvers in the Presence of Noise
• Operator Sampling for Shot-frugal Optimization in Variational Algorithms
• Hybrid Quantum/Classical Derivative Theory: Analytical Gradients and Excited-State Dynamics for the Multistate Contracted Variational Quantum Eigensolver
• Adaptive shot allocation for fast convergence in variational quantum algorithms
• Analytical Ground- and Excited-State Gradients for Molecular Electronic Structure Theory from Hybrid Quantum/Classical Methods
• A quantum algorithm to count weighted ground states of classical spin Hamiltonians