Demarie, T.F., Ouyang, Y. orcid.org/0000-0003-1115-0074 and Fitzsimons, J.F. (2018) Classical verification of quantum circuits containing few basis changes. Physical Review A, 97 (4). ISSN 2469-9926
Abstract
We consider the task of verifying the correctness of quantum computation for a restricted class of circuits which contain at most two basis changes. This contains circuits giving rise to the second level of the Fourier hierarchy, the lowest level for which there is an established quantum advantage. We show that when the circuit has an outcome with probability at least the inverse of some polynomial in the circuit size, the outcome can be checked in polynomial time with bounded error by a completely classical verifier. This verification procedure is based on random sampling of computational paths and is only possible given knowledge of the likely outcome.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2018 American Physical Society. Reproduced in accordance with the publisher's self-archiving policy. |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Science (Sheffield) > Department of Physics and Astronomy (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 11 Oct 2019 09:27 |
Last Modified: | 11 Oct 2019 09:27 |
Status: | Published |
Publisher: | American Physical Society (APS) |
Refereed: | Yes |
Identification Number: | 10.1103/physreva.97.042319 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:152026 |