.png){kind=icon}
Return
Using Differential Evolution to avoid local minima in Variational Quantum Algorithms
.png){kind=icon}
OA
AI
DOI：10.1038/s41598-023-43404-3.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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: (1) it does not depend on gradients, and (2) 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.
Keywords:
OPTIMIZATION
EIGENSOLVER
MODEL
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.9
Papers:
27.9W
Citations:
83.5W
Organization
Cited Papers
ShareSaveShareSaveObserving ground-state properties of the Fermi-Hubbard model using a scalable algorithm on a quantum computer.png)
NATURE COMMUNICATIONSOAAI
NATURE COMMUNICATIONSIF15.7
OAAIShareSaveQuantum algorithm for electronic band structures with local tight-binding orbitalsSCIENTIFIC REPORTSOAAI
SCIENTIFIC REPORTSIF3.9
OAAIShareSave
View more