Classical zero-knowledge arguments for quantum computations
Quantum Physics
2020-05-20 v4
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).
Cite
@article{arxiv.1902.05217,
title = {Classical zero-knowledge arguments for quantum computations},
author = {Thomas Vidick and Tina Zhang},
journal= {arXiv preprint arXiv:1902.05217},
year = {2020}
}