Efficient Estimation and Sequential Optimization of Cost Functions in Variational Quantum Algorithms
arXiv:2412.20972 · doi:10.1088/2058-9565/add55e
Abstract
Classical optimization is a cornerstone of the success of variational quantum algorithms, which often require determining the derivatives of the cost function relative to variational parameters. The computation of the cost function and its derivatives, coupled with their effective utilization, facilitates faster convergence by enabling smooth navigation through complex landscapes, ensuring the algorithm's success in addressing challenging variational problems. In this work, we introduce a novel optimization methodology that conceptualizes the parameterized quantum circuit as a weighted sum of distinct unitary operators, enabling the cost function to be expressed as a sum of multiple terms. This representation facilitates the efficient evaluation of nonlocal characteristics of cost functions, as well as their arbitrary derivatives. The optimization protocol then utilizes the nonlocal information on the cost function to facilitate a more efficient navigation process, ultimately enhancing the performance in the pursuit of optimal solutions. We utilize this methodology for two distinct cost functions. The first is the squared residual of the variational state relative to a target state, which is subsequently employed to examine the nonlinear dynamics of fluid configurations governed by the one-dimensional Burgers' equation. The second cost function is the expectation value of an observable, which is later utilized to approximate the ground state of the nonlinear Schrödinger equation. Our findings reveal substantial enhancements in convergence speed and accuracy relative to traditional optimization methods, even within complex, high-dimensional landscapes. Our work contributes to the advancement of optimization strategies for variational quantum algorithms, establishing a robust framework for addressing a range of computationally intensive problems across numerous applications.
16 pages, 6 figures, comments are welcome
References in corpus (45)
- SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
- A variational eigenvalue solver on a quantum processor
- Quantum algorithm for solving linear systems of equations
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Barren plateaus in quantum neural network training landscapes
- The theory of variational hybrid quantum-classical algorithms
- Noisy intermediate-scale quantum (NISQ) algorithms
- Error mitigation for short-depth quantum circuits
- Parameterized quantum circuits as machine learning models
- Evaluating analytic gradients on quantum hardware
- Scalable Quantum Simulation of Molecular Energies
- Hartree-Fock on a superconducting qubit quantum computer
- Towards Practical Quantum Variational Algorithms
- Fault-Tolerant Quantum Dynamical Decoupling
- Practical Quantum Error Mitigation for Near-Future Applications
- Quantum chemistry calculations on a trapped-ion quantum simulator
- Training variational quantum algorithms is NP-hard
- Burgers Turbulence
- Variational quantum algorithms for nonlinear problems
- Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator
- Variational Fast Forwarding for Quantum Simulation Beyond the Coherence Time
- Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
- Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
- Barren Plateaus in Variational Quantum Computing
- Training of Quantum Circuits on a Hybrid Quantum Computer
- Structure optimization for parameterized quantum circuits
- Real- and imaginary-time evolution with compressed quantum circuits
- Sequential minimal optimization for quantum-classical hybrid algorithms
- Estimating the gradient and higher-order derivatives on quantum hardware
- Methodology for replacing indirect measurements with direct measurements
- Gate-efficient simulation of molecular eigenstates on a quantum computer
- Low-depth gradient measurements can improve convergence in variational hybrid quantum-classical algorithms
- Measuring Analytic Gradients of General Quantum Evolution with the Stochastic Parameter Shift Rule
- Variational Quantum Algorithms for Computational Fluid Dynamics
- Multigrid Renormalization
- Qubit-efficient encoding schemes for binary optimisation problems
- Expressibility and trainability of parameterized analog quantum systems for machine learning applications
- Quantum Variational Solving of Nonlinear and Multi-Dimensional Partial Differential Equations
- Non-trivial symmetries in quantum landscapes and their resilience to quantum noise
- Single-component gradient rules for variational quantum algorithms
- Adaptive projected variational quantum dynamics
- Sequential optimal selection of a single-qubit gate and its relation to barren plateau in parameterized quantum circuits
- Probing the limits of variational quantum algorithms for nonlinear ground states on real quantum hardware: The effects of noise
- Sequence of penalties method to study excited states using VQE