Interactive proofs for BQP via self-tested graph states (extended abstract)
arXiv:1311.1534
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.
13 pages. arXiv admin note: substantial text overlap with arXiv:1309.5675
References in corpus (7)
- Device-independent security of quantum cryptography against collective attacks
- Device-independent quantum key distribution secure against collective attacks
- Robust Self Testing of the Singlet
- Interactive proofs for BQP via self-tested graph states
- Optimal robust quantum self-testing by binary nonlocal XOR games
- A classical leash for a quantum system: Command of quantum systems via rigidity of CHSH games
- Quantum Information Processing with Adversarial Devices