The theory of variational hybrid quantum-classical algorithms

DSpace/Manakin Repository

The theory of variational hybrid quantum-classical algorithms

Citable link to this page

 

 
Title: The theory of variational hybrid quantum-classical algorithms
Author: McClean, Jarrod Ryan; Romero, Jonathan; Babbush, Ryan Joseph ORCID  0000-0001-6979-9533 ; Aspuru-Guzik, Alan

Note: Order does not necessarily reflect citation order of authors.

Citation: McClean, Jarrod R, Jonathan Romero, Ryan Babbush, and Alán Aspuru-Guzik. 2016. “The Theory of Variational Hybrid Quantum-Classical Algorithms.” New J. Phys. 18 (2) (February 4): 023023. doi:10.1088/1367-2630/18/2/023023.
Full Text & Related Files:
Abstract: Many quantum algorithms have daunting resource requirements when compared to what is available today. To address this discrepancy, a quantum-classical hybrid optimization scheme known as 'the quantum variational eigensolver' was developed (Peruzzo et al 2014 Nat. Commun. 5 4213) with the philosophy that even minimal quantum resources could be made useful when used in conjunction with classical routines. In this work we extend the general theory of this algorithm and suggest algorithmic improvements for practical implementations. Specifically, we develop a variational adiabatic ansatz and explore unitary coupled cluster where we establish a connection from second order unitary coupled cluster to universal gate sets through a relaxation of exponential operator splitting. We introduce the concept of quantum variational error suppression that allows some errors to be suppressed naturally in this algorithm on a pre-threshold quantum device. Additionally, we analyze truncation and correlated sampling in Hamiltonian averaging as ways to reduce the cost of this procedure. Finally, we show how the use of modern derivative free optimization techniques can offer dramatic computational savings of up to three orders of magnitude over previously used optimization techniques.
Published Version: doi:10.1088/1367-2630/18/2/023023
Other Sources: http://arxiv.org/pdf/1509.04279v1.pdf
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:25658993
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)

 
 

Search DASH


Advanced Search
 
 

Submitters