arrow
Return

Variational quantum algorithm with information sharing

delete2021-07-22
delete25
delete
OA
AI
C
Chris N. Self *
K
Khosla, Kiran E.
A
Alistair W. R. Smith
F
Frédéric Sauvage
P
Peter D. Haynes
J
Johannes Knolle
M
Mintert, Florian
K
Kim, M. S.
DOI:10.1038/s41534-021-00452-9delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
We introduce an optimisation method for variational quantum algorithms and experimentally demonstrate a 100-fold improvement in efficiency compared to naive implementations. The effectiveness of our approach is shown by obtaining multi-dimensional energy surfaces for small molecules and a spin model. Our method solves related variational problems in parallel by exploiting the global nature of Bayesian optimisation and sharing information between different optimisers. Parallelisation makes our method ideally suited to the next generation of variational problems with many physical degrees of freedom. This addresses a key challenge in scaling-up quantum algorithms towards demonstrating quantum advantage for problems of real-world interest.
Keywords:
ANSATZE
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

npj Quantum Information cover
npj Quantum Information
IF:
8.3
Papers:
1.4K
Citations:
8.1K

Organization

I
Imperial College London
Scholars:
8.3W
Papers: 7.3W
Citations: 11.1W