Verifying BQP Computations on Noisy Devices with Minimal Overhead

TL;DR

This paper presents a minimal-overhead, noise-tolerant protocol for verifying BQP quantum computations delegated to a server, ensuring confidentiality and integrity even with noisy devices.

Contribution

It introduces the first blind and verifiable protocol for BQP delegation that tolerates noise with only repetition overhead, improving practicality.

Findings

Protocol is statistically secure with exponential bounds

Can tolerate a constant amount of global noise

Repetition is the only overhead

Abstract

With the development of delegated quantum computation, clients will want to ensure confidentiality of their data and algorithms, and the integrity of their computations. While protocols for blind and verifiable quantum computation exist, they suffer from high overheads and from over-sensitivity: When running on noisy devices, imperfections trigger the same detection mechanisms as malicious attacks, resulting in perpetually aborted computations. We introduce the first blind and verifiable protocol for delegating BQP computations to a powerful server with repetition as the only overhead. It is composable and statistically secure with exponentially-low bounds and can tolerate a constant amount of global noise.