Cryptology ePrint Archive: Report 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).

Category / Keywords: cryptographic protocols / zero knowledge, quantum computation

Date: received 18 Feb 2019, last revised 25 Feb 2019

Contact author: vidick at cms caltech edu

Available format(s): PDF | BibTeX Citation

Version: 20190227:024550 (All versions of this report)

Short URL: ia.cr/2019/194


[ Cryptology ePrint archive ]