Using Differential Evolution to avoid local minima in Variational Quantum Algorithms
arXiv:2303.12186 · doi:10.1038/s41598-023-43404-3
Abstract
Variational Quantum Algorithms (VQAs) are among the most promising NISQ-era algorithms for harnessing quantum computing in diverse fields. However, the underlying optimization processes within these algorithms usually deal with local minima and barren plateau problems, preventing them from scaling efficiently. Our goal in this paper is to study alternative optimization methods that can avoid or reduce the effect of these problems. To this end, we propose to apply the Differential Evolution (DE) algorithm to VQAs optimizations. Our hypothesis is that DE is resilient to vanishing gradients and local minima for two main reasons: (i) it does not depend on gradients, and (ii) its mutation and recombination schemes allow DE to continue evolving even in these cases. To demonstrate the performance of our approach, first, we use a robust local minima problem to compare state-of-the-art local optimizers (SLSQP, COBYLA, L-BFGS-B and SPSA) against DE using the Variational Quantum Eigensolver algorithm. Our results show that DE always outperforms local optimizers. In particular, in exact simulations of a 1D Ising chain with 14 qubits, DE achieves the ground state with a 100\% success rate, while local optimizers only exhibit around 40\%. We also show that combining DE with local optimizers increases the accuracy of the energy estimation once avoiding local minima. Finally, we demonstrate how our results can be extended to more complex problems by studying DE performance in a 1D Hubbard model.
arXiv comment12 pages, 5 figures
References in corpus (33)
- 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
- A Quantum Approximate Optimization Algorithm
- Quantum computational chemistry
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- The Variational Quantum Eigensolver: a review of methods and best practices
- Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
- Towards Practical Quantum Variational Algorithms
- Connecting ansatz expressibility to gradient magnitudes and barren plateaus
- Quantum Natural Gradient
- Training variational quantum algorithms is NP-hard
- Variational quantum algorithms for nonlinear problems
- Solving strongly correlated electron models on a quantum computer
- Variational quantum algorithms for discovering Hamiltonian spectra
- The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size
- Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
- Effect of barren plateaus on gradient-free optimization
- Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
- Resource-Efficient Quantum Algorithm for Protein Folding
- Doubling the size of quantum simulators by entanglement forging
- Quantum algorithms to simulate many-body physics of correlated fermions
- Avoiding local minima in variational quantum eigensolvers with the natural gradient optimizer
- Electron-Phonon Systems on a Universal Quantum Computer
- Observing ground-state properties of the Fermi-Hubbard model using a scalable algorithm on a quantum computer
- Variational Quantum Reinforcement Learning via Evolutionary Optimization
- ADAPT-VQE is insensitive to rough parameter landscapes and barren plateaus
- Robust resource-efficient quantum variational ansatz through evolutionary algorithm
- Gutzwiller Hybrid Quantum-Classical Computing Approach for Correlated Materials
- Simulating strongly interacting Hubbard chains with the Variational Hamiltonian Ansatz on a quantum computer
- Gutzwiller wave function on a digital quantum computer
- Simulating a ring-like Hubbard system with a quantum computer
Cited by in corpus (6)
- Review of Distributed Quantum Computing. From single QPU to High Performance Quantum Computing
- Deep Learning Methods for Colloidal Silver Nanoparticle Concentration and Size Distribution Determination from UV-Vis Extinction Spectra
- Networked Quantum Services
- Pitfalls when tackling the exponential concentration of parameterized quantum models
- Regularizing quantum loss landscapes by noise injection
- Batched Line Search Strategy for Navigating through Barren Plateaus in Quantum Circuit Training