Device-Independent Verifiable Blind Quantum Computation
arXiv:1502.02563
Abstract
As progress on experimental quantum processors continues to advance, the problem of verifying the correct operation of such devices is becoming a pressing concern. The recent discovery of protocols for verifying computation performed by entangled but non-communicating quantum processors holds the promise of certifying the correctness of arbitrary quantum computations in a fully device-independent manner. Unfortunately, all known schemes have prohibitive overhead, with resources scaling as extremely high degree polynomials in the number of gates constituting the computation. Here we present a novel approach based on a combination of verified blind quantum computation and Bell state self-testing. This approach has dramatically reduced overhead, with resources scaling as only in the number of gates.
arXiv commentShortly before submission of this preprint, the authors became aware of parallel and independent research by Gheorghiu, Kashefi and Wallden, which also addresses device-independent verifiable blind quantum computation, and appears simultaneously
References in corpus (15)
- Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
- Random Numbers Certified by Bell's Theorem
- High-fidelity two-qubit quantum logic gates using trapped calcium-43 ions
- High-fidelity quantum logic gates using trapped-ion hyperfine qubits
- High-fidelity preparation, gates, memory and readout of a trapped-ion quantum bit
- Experimental Demonstration of Blind Quantum Computing
- Unconditionally verifiable blind computation
- Robust Self Testing of the Singlet
- Blind quantum computation protocol in which Alice only makes measurements
- Experimental verification of quantum computations
- Interactive Proofs For Quantum Computations
- Optimal Blind Quantum Computation
- Interactive proofs for BQP via self-tested graph states
- Composable security of delegated quantum computation
- Secure entanglement distillation for double-server blind quantum computation
Cited by in corpus (23)
- Unconditionally verifiable blind computation
- Verifiable measurement-only blind quantum computing with stabilizer testing
- Verification of quantum computation: An overview of existing approaches
- Simple and tight device-independent security proofs
- Post hoc verification with a single prover
- Post hoc verification of quantum computation
- Rigidity of quantum steering and one-sided device-independent verifiable quantum computation
- Certifying the building blocks of quantum computers from Bell's theorem
- Self-guaranteed measurement-based quantum computation
- Attacking the Quantum Internet
- Noise-resistant device-independent certification of Bell state measurements
- Blind quantum computation over a collective-noise channel
- Non-interactive classical verification of quantum computation
- Client-friendly continuous-variable blind and verifiable quantum computing
- Classical verification of quantum circuits containing few basis changes
- Reductions to IID in Device-independent Quantum Information Processing
- Authenticated teleportation with one-sided trust
- On optimising quantum communication in verifiable quantum computing
- Blind Quantum Computation Using a Circuit-Based Quantum Computer
- Role of Hypothesis Testing in Quantum Information
- Composable secure multi-client delegated quantum computation
- Exposure of subtle multipartite quantum nonlocality
- Practical parallel self-testing of Bell states via magic rectangles