Benchmarking of Different Optimizers in the Variational Quantum Algorithms for Applications in Quantum Chemistry

Abstract

Classical optimizers play a crucial role in determining the accuracy and convergence of variational quantum algorithms. In literature, many optimizers, each having its own architecture, have been employed expediently for different applications. In this work, we consider a few popular optimizers and assess their performance in variational quantum algorithms for applications in quantum chemistry in a realistic noisy setting. We benchmark the optimizers with critical analysis based on quantum simulations of simple molecules, such as Hydrogen, Lithium Hydride, Beryllium Hydride, water, and Hydrogen Fluoride. The errors in the ground-state energy, dissociation energy, and dipole moment are the parameters used as yardsticks. All the simulations were carried out with an ideal quantum circuit simulator, a noisy quantum circuit simulator, and a noisy simulator with noise embedded from the IBM Cairo quantum device to understand the performance of the classical optimizers in ideal and realistic quantum environments. We used the standard unitary coupled cluster (UCC) ansatz for simulations, and the number of qubits varied from two, starting from the Hydrogen molecule to ten qubits, in Hydrogen Fluoride. Based on the performance of these optimizers in the ideal quantum circuits, the conjugate gradient (CG), limited-memory Broyden-Fletcher-Goldfarb-Shanno bound (L_BFGS)B), and sequential least squares programming (SLSQP) optimizers are found to be the best-performing gradient-based optimizers. While constrained optimization by linear approximation (COBYLA) and POWELL perform most efficiently among the gradient-free methods. However, in noisy quantum circuit conditions, Simultaneous Perturbation Stochastic Approximation (SPSA), POWELL, and COBYLA are among the best-performing optimizers.

References in corpus (8)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Simulated Quantum Computation of Molecular Energies
• Tapering off qubits to simulate fermionic Hamiltonians
• On the construction of model Hamiltonians for adiabatic quantum computation and its application to finding low energy conformations of lattice protein models
• A Comparison of Various Classical Optimizers for a Variational Quantum Linear Solver
• Scalable Benchmarks for Gate-Based Quantum Computers
• Linear Ascending Metrological Algorithm
• VeriQBench: A Benchmark for Multiple Types of Quantum Circuits

Cited by in corpus (18)

• Benchmarking quantum computers
• An Empirical Comparison of Optimizers for Quantum Machine Learning with SPSA-based Gradients
• A Perspective on Quantum Computing Applications in Quantum Chemistry using 25--100 Logical Qubits
• Hückel Molecular Orbital Theory on a Quantum Computer: A Scalable System-Agnostic Variational Implementation with Compact Encoding
• Efficient and Robust Parameter Optimization of the Unitary Coupled-Cluster Ansatz
• Variational quantum computing for quantum simulation: principles, implementations, and challenges
• A Study on Quantum Graph Neural Networks Applied to Molecular Physics
• SHARC-VQE: Simplified Hamiltonian Approach with Refinement and Correction enabled Variational Quantum Eigensolver for Molecular Simulation
• Simulating thermodynamic properties of dinuclear metal complexes using Variational Quantum Algorithms
• Scalability Challenges in Variational Quantum Optimization under Stochastic Noise
• Pitfalls when tackling the exponential concentration of parameterized quantum models
• An Efficient Decomposition of the Carleman Linearized Burgers' Equation
• Limitations of Quantum Hardware for Molecular Energy Estimation Using VQE
• Benchmarking of quantum fidelity kernels for Gaussian process regression
• On The Study Of Partial Qubit Hamiltonian For Efficient Molecular Simulation Using Variational Quantum Eigensolvers
• Quantum Simulations of Chemical Reactions: Achieving Accuracy with NISQ Devices
• Blockwise Optimization for Projective Variational Quantum Dynamics (BLOP-VQD): Algorithm and Implementation for Lattice Systems
• Improving the trainability of VQE on NISQ computers for solving portfolio optimization using convex interpolation