Interactive proofs for BQP via self-tested graph states (extended abstract)
Quantum Physics
2013-11-08 v1
Abstract
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 in specified bases. In this extended abstract we give an overview of the construction and proofs.
Cite
@article{arxiv.1311.1534,
title = {Interactive proofs for BQP via self-tested graph states (extended abstract)},
author = {Matthew McKague},
journal= {arXiv preprint arXiv:1311.1534},
year = {2013}
}
Comments
13 pages. arXiv admin note: substantial text overlap with arXiv:1309.5675