Interactive proofs for BQP via selftested graph states
Abstract
Using the measurementbased quantum computation model, we construct interactive proofs with noncommunicating quantum provers and a classical verifier. Our construction gives interactive proofs for all languages in BQP with a polynomial number of quantum provers, each of which, in the honest case, performs only a single measurement. Our techniques use selftested graph states. In this regard we introduce two important improvements over previous work. Specifically, we derive new error bounds which scale polynomially with the size of the graph compared with exponential dependence on the size of the graph in previous work. We also extend the selftesting error bounds on measurements to a very general set which includes the adaptive measurements used for measurementbased quantum computation as a special case.
 Publication:

arXiv eprints
 Pub Date:
 September 2013
 arXiv:
 arXiv:1309.5675
 Bibcode:
 2013arXiv1309.5675M
 Keywords:

 Quantum Physics
 EPrint:
 53 pages