pith. sign in

arxiv: 1603.06046 · v1 · pith:LPJ6ZOJQnew · submitted 2016-03-19 · 🪐 quant-ph

Post hoc verification with a single prover

classification 🪐 quant-ph
keywords provercomputationonlysingleverificationbasisbeenclassical
0
0 comments X
read the original abstract

We propose a simple protocol for the verification of quantum computation after the computation has been performed. Our construction can be seen as an improvement on previous results in that it requires only a single prover, who is restricted to measuring qubits in the $X$ or $Z$ basis, while requiring only one way communication, from the prover to the verifier. We also show similar constant round protocols with purely classical verifiers are not possible, unless BQP is contained in the third level of the polynomial hierarchy.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.