• Editors' Suggestion
  • Letter
  • Open Access

Universal variational quantum computation

Jacob Biamonte
Phys. Rev. A 103, L030401 – Published 10 March 2021
PDFHTMLExport Citation

Abstract

Variational quantum algorithms dominate contemporary gate-based quantum enhanced optimization, eigenvalue estimation, and machine learning. Here we establish the quantum computational universality of variational quantum computation by developing two objective functions which minimize to prepare outputs of arbitrary quantum circuits. The fleeting resource of variational quantum computation is the number of expected values which must be iteratively minimized using classical-to-quantum outer loop optimization. An efficient solution to this optimization problem is given by the quantum circuit being simulated itself. The first construction is efficient in the number of expected values for n-qubit circuits containing O(polylnn) non-Clifford gates—the number of expected values has no dependence on Clifford gates appearing in the simulated circuit. The second approach yields O(L2) expected values whereas introducing not more than O(lnL) slack qubits for a quantum circuit partitioned into L gates. Hence, the utilitarian variational quantum programming procedure—based on the classical evaluation of objective functions and iterated feedback—is, in principle, as powerful as any other model of quantum computation. This result elevates the formal standing of the variational approach whereas establishing a universal model of quantum computation.

  • Received 8 August 2020
  • Revised 29 December 2020
  • Accepted 12 January 2021

DOI:https://doi.org/10.1103/PhysRevA.103.L030401

Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.

Published by the American Physical Society

Physics Subject Headings (PhySH)

Quantum Information, Science & Technology

Authors & Affiliations

Jacob Biamonte*

  • Skolkovo Institute of Science and Technology, 3 Nobel Street, Moscow 121205, Russia

Article Text

Click to Expand

Supplemental Material

Click to Expand

References

Click to Expand
Issue

Vol. 103, Iss. 3 — March 2021

Reuse & Permissions
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

×

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×