Variational quantum algorithm with information sharing

21Citations
Citations of this article
42Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

Self, C. N., Khosla, K. E., Smith, A. W. R., Sauvage, F., Haynes, P. D., Knolle, J., … Kim, M. S. (2021). Variational quantum algorithm with information sharing. Npj Quantum Information, 7(1). https://doi.org/10.1038/s41534-021-00452-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free