Optimised resource construction for verifiable quantum computation

TL;DR

This paper introduces a simplified, resource-efficient method for verifiable blind quantum computing that maintains security regardless of computation size and is applicable to various quantum schemes.

Contribution

It presents a new construction that reduces resource overhead to linear in input size and is adaptable to any non-universal quantum computing scheme.

Findings

Overhead is linear in input size.

Security parameter is independent of computation size.

Method applicable to any non-universal scheme with a specified graph.

Abstract

Recent developments make the possibility of achieving scalable quantum networks and quantum devices closer. From the computational point of view these emerging technologies become relevant when they are no longer classically simulatable. Hence a pressing challenge is the construction of practical methods to verify the correctness of the outcome produced by universal or non-universal quantum devices. A promising approach that has been extensively explored is the scheme of verification via encryption through blind quantum computing initiated by Fitzsimons and Kashefi. We present here a new construction that simplifies the required resources for any such verifiable blind quantum computating protocol. We obtain an overhead that is linear in the size of the input, while the security parameter remains independent of the size of the computation and can be made exponentially small. Furthermore our construction is generic and could be applied to any non-universal scheme with a given underlying graph.