Classical zero-knowledge arguments for quantum computations
arXiv:1902.05217 · doi:10.22331/q-2020-05-14-266
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).
References in corpus (9)
- Universal blind quantum computation
- Unconditionally verifiable blind computation
- Realizable Hamiltonians for Universal Adiabatic Quantum Computers
- Interactive Proofs For Quantum Computations
- Post hoc verification with a single prover
- Post hoc verification of quantum computation
- Non-interactive classical verification of quantum computation
- Quantum proofs can be verified using only single qubit measurements
- Zero-knowledge proof systems for QMA