CaltechAUTHORS
  A Caltech Library Service

Verifier-on-a-Leash: new schemes for verifiable delegated quantum computation, with quasilinear resources

Coladangelo, Andrea and Grilo, Alex and Jeffery, Stacey and Vidick, Thomas (2017) Verifier-on-a-Leash: new schemes for verifiable delegated quantum computation, with quasilinear resources. . (Unpublished) http://resolver.caltech.edu/CaltechAUTHORS:20190320-123759874

[img] PDF - Submitted Version
See Usage Policy.

572Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20190320-123759874

Abstract

The problem of reliably certifying the outcome of a computation performed by a quantum device is rapidly gaining relevance. We present two protocols for a classical verifier to verifiably delegate a quantum computation to two non-communicating but entangled quantum provers. Our protocols have near-optimal complexity in terms of the total resources employed by the verifier and the honest provers, with the total number of operations of each party, including the number of entangled pairs of qubits required of the honest provers, scaling as O(g log g) for delegating a circuit of size g. This is in contrast to previous protocols, which all require a prohibitively large polynomial overhead. Our first protocol requires a number of rounds that is linear in the depth of the circuit being delegated, and is blind, meaning neither prover can learn the circuit being delegated. The second protocol is not blind, but requires only a constant number of rounds of interaction. Our main technical innovation is an efficient rigidity theorem which allows a verifier to test that two entangled provers perform measurements specified by an arbitrary m-qubit tensor product of single-qubit Clifford observables on their respective halves of m shared EPR pairs, with a robustness that is independent of m. Our two-prover classical-verifier delegation protocols are obtained by combining this rigidity theorem with a single-prover quantum-verifier protocol for the verifiable delegation of a quantum computation, introduced by Broadbent.


Item Type:Report or Paper (Discussion Paper)
Related URLs:
URLURL TypeDescription
http://arxiv.org/abs/1708.07359arXivDiscussion Paper
ORCID:
AuthorORCID
Vidick, Thomas0000-0002-6405-365X
Additional Information:Supported by AFOSR YIP award number FA9550-16-1-0495. Supported by ERC QCC. Supported by an NWO WISE Grant. Supported by NSF CAREER Grant CCF-1553477, AFOSR YIP award number FA9550-16-1-0495, and the IQIM, an NSF Physics Frontiers Center (NSF Grant PHY-1125565) with support of the Gordon and Betty Moore Foundation (GBMF-12500028). We thank Anne Broadbent for useful discussions in the early stages of this work. All authors acknowledge the IQIM, an NSF Physics Frontiers Center at the California Institute of Technology, where this research was initiated.
Group:IQIM, Institute for Quantum Information and Matter
Funders:
Funding AgencyGrant Number
Air Force Office of Scientific Research (AFOSR)FA9550-16-1-0495
European Research Council (ERC)UNSPECIFIED
Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO)UNSPECIFIED
NSFCCF-1553477
Institute for Quantum Information and Matter (IQIM)UNSPECIFIED
NSFPHY-1125565
Gordon and Betty Moore FoundationGBMF-12500028
Record Number:CaltechAUTHORS:20190320-123759874
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:20190320-123759874
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:93993
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:20 Mar 2019 19:45
Last Modified:20 Mar 2019 19:45

Repository Staff Only: item control page