Classical zero-knowledge arguments for quantum computations

Creators: Vidick, Thomas; Zhang, Tina

Abstract

We show that every language in QMA 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 QMA, with a classical verifier, introduced by Mahadev (FOCS 2018).

Additional Information

© 2020 This Paper is published in Quantum under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. Copyright remains with the original copyright holders such as the authors or their institutions. We thank Zvika Brakerski, Andru Gheorghiu, and Zhengfeng Ji for useful discussions. Thomas Vidick is supported by NSF CAREER Grant CCF-1553477, AFOSR YIP award number FA9550-16-1-0495, MURI Grant FA9550-18-1-0161, a CIFAR Azrieli Global Scholar award, and the IQIM, an NSF Physics Frontiers Center (NSF Grant PHY-1125565) with support of the Gordon and Betty Moore Foundation (GBMF-12500028). Tina Zhang acknowledges support from the Richard G. Brewer Prize and Caltech's Ph11 program.

Attached Files

Published - q-2020-05-14-266.pdf

Submitted - 1902.05217.pdf

Files

1902.05217.pdf

Files (3.9 MB)

Name	Size	Download all
1902.05217.pdf md5:d17cf9bd8c9a98af276371f8f8e33e43	1.8 MB	Preview Download
q-2020-05-14-266.pdf md5:564855c9a35b0823d038e38997acbb01	2.1 MB	Preview Download

Additional details

	All versions	This version
Views	0	0
Downloads	0	0
Data volume	0 Bytes	0 Bytes