Variational quantum algorithm with information sharing
ORAL
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.
–
Publication: Self, C.N., Khosla, K.E., Smith, A.W.R. et al. Variational quantum algorithm with information sharing. npj Quantum Inf 7, 116 (2021). https://doi.org/10.1038/s41534-021-00452-9
Presenters
-
Chris N Self
Imperial College London
Authors
-
Chris N Self
Imperial College London
-
Kiran E Khosla
Imperial College London
-
Alistair W Smith
Imperial College London
-
Frédéric Sauvage
Imperial College London
-
Peter D Haynes
Imperial College London
-
Johannes Knolle
Univ of Cambridge, Technical University of Munich
-
Florian Mintert
Imperial College London
-
Myungshik Kim
Imperial College London