Device-Independent Verifiable Blind Quantum Computation

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.

Shortly 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