Name
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). |
Year | DOI | Venue |
|---|---|---|
2019 | 10.22331/q-2020-05-14-266 | QUANTUM |
Field | DocType | Volume |
Quantum,Discrete mathematics,Zero-knowledge proof,Mathematics,Computation,BQP | Journal | 4 |
ISSN | Citations | PageRank |
2521-327X | 0 | 0.34 |
References | Authors | |
9 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Vidick | 1 | 377 | 31.69 |
| Tina Zhang | 2 | 0 | 0.34 |