Efficient universal blind computation

TL;DR

This paper presents an efficient, cheat-sensitive protocol for blind quantum computation that enables a limited-capability client to perform arbitrary quantum computations on a server's quantum computer without revealing any details, optimizing resource use.

Contribution

It introduces a resource-efficient, cheat-sensitive protocol for universal blind quantum computation that requires minimal client capabilities and does not depend on measurement-based models.

Findings

Protocol requires O(J log(N)) single-qubit states exchange

Client only needs to prepare and measure single-qubit superposition states

Protocol is efficient in computational and communication resources

Abstract

We give a cheat sensitive protocol for blind universal quantum computation that is efficient in terms of computational and communication resources: it allows one party to perform an arbitrary computation on a second party's quantum computer without revealing either which computation is performed, or its input and output. The first party's computational capabilities can be extremely limited: she must only be able to create and measure single-qubit superposition states. The second party is not required to use measurement-based quantum computation. The protocol requires the (optimal) exchange of O(J log(N)) single-qubit states, where J is the computational depth and N is the number of qubits needed for the computation.