pith. sign in

arxiv: 1502.02563 · v2 · pith:NHBSZXY6new · submitted 2015-02-09 · 🪐 quant-ph · cs.CC· cs.CR

Device-Independent Verifiable Blind Quantum Computation

classification 🪐 quant-ph cs.CCcs.CR
keywords quantumcomputationapproachblinddevice-independentgatesnumberoverhead
0
0 comments X
read the original 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 $O(m^4\ln m)$ in the number of gates.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.