On optimising quantum communication in verifiable quantum computing
arXiv:1506.06943
Abstract
In the absence of any efficient classical schemes for verifying a universal quantum computer, the importance of limiting the required quantum resources for this task has been highlighted recently. Currently, most of efficient quantum verification protocols are based on cryptographic techniques where an almost classical verifier executes her desired encrypted quantum computation remotely on an untrusted quantum prover. In this work we present a new protocol for quantum verification by incorporating existing techniques in a non-standard composition to reduce the required quantum communications between the verifier and the prover.
References in corpus (11)
- Topological fault-tolerance in cluster state quantum computation
- Efficient experimental validation of photonic boson sampling against the uniform distribution
- Unconditionally verifiable blind computation
- Authentication of Quantum Messages
- Verifiable measurement-only blind quantum computing with stabilizer testing
- Reliable quantum certification for photonic quantum technologies
- Quantum one-time programs
- Optimal Blind Quantum Computation
- Interactive proofs for BQP via self-tested graph states
- Overcoming efficiency constraints on blind quantum computation
- Device-Independent Verifiable Blind Quantum Computation