Device-Independent Verifiable Blind Quantum Computation

TL;DR

This paper introduces a new method for device-independent verifiable blind quantum computation that significantly reduces resource overhead by combining verified blind quantum computation with Bell state self-testing.

Contribution

It presents a novel approach that combines verified blind quantum computation and Bell state self-testing to achieve lower resource overhead in quantum verification.

Findings

Resource scaling is reduced to O(m^4 log m)

Enables practical verification of quantum computations

Improves upon previous high-overhead schemes

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.