Interactive proofs for BQP via self-tested graph states (extended abstract) [article]

Matthew McKague
2013 arXiv   pre-print
Using the measurement-based quantum computation model, we construct interactive proofs with non-communicating 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 self-tested graph states which allow us to test the provers for honesty, establishing that they hold onto a particular graph state and measure it
more » ... in specified bases. In this extended abstract we give an overview of the construction and proofs.
arXiv:1311.1534v1 fatcat:p26svrv7hfd5zpu5luuxn5z57a