Classical zero-knowledge arguments for quantum computations

Thomas Vidick; Tina Zhang

Paper 2019/194

Classical zero-knowledge arguments for quantum computations

Thomas Vidick and Tina Zhang

Abstract

We show that every language in BQP admits a classical-verifier, quantum-prover zero-knowledge argument system which is sound against quantum polynomial-time provers and zero-knowledge for classical (and quantum) polynomial-time verifiers. The protocol builds upon two recent results: a computational zero-knowledge proof system for languages in QMA, with a quantum verifier, introduced by Broadbent et al. (FOCS 2016), and an argument system for languages in BQP, with a classical verifier, introduced by Mahadev (FOCS 2018).

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint. MINOR revision.
Keywords: zero knowledge quantum computation
Contact author(s): vidick @ cms caltech edu
History: 2019-02-27: received
Short URL: https://ia.cr/2019/194
License: CC BY

BibTeX

@misc{cryptoeprint:2019/194,
      author = {Thomas Vidick and Tina Zhang},
      title = {Classical zero-knowledge arguments for quantum computations},
      howpublished = {Cryptology ePrint Archive, Paper 2019/194},
      year = {2019},
      note = {\url{https://eprint.iacr.org/2019/194}},
      url = {https://eprint.iacr.org/2019/194}
}