A simple protocol for fault tolerant verification of quantum computation

Gheorghiu, Alexandru; Hoban, Matty J. and Kashefi, Elham. 2018. A simple protocol for fault tolerant verification of quantum computation. Quantum Science and Technology, 4(1), [Article]

ft.pdf - Accepted Version
Available under License Creative Commons Attribution.

Download (356kB) | Preview

Abstract or Description

With experimental quantum computing technologies now in their infancy, the search for efficient means of testing the correctness of these quantum computations is becoming more pressing. An approach to the verification of quantum computation within the framework of interactive proofs has been fruitful for addressing this problem. Specifically, an untrusted agent (prover) alleging to perform quantum computations can have his claims verified by another agent (verifier) who only has access to classical computation and a small quantum device for preparing or measuring single qubits. However, when this quantum device is prone to errors, verification becomes challenging and often existing protocols address this by adding extra assumptions, such as requiring the noise in the device to be uncorrelated with the noise on the prover's devices. In this paper, we present a simple protocol for verifying quantum computations, in the presence of noisy devices, with no extra assumptions. This protocol is based on post hoc techniques for verification, which allow for the prover to know the desired quantum computation and its input. We also perform a simulation of the protocol, for a one-qubit computation, and find the error thresholds when using the qubit repetition code as well as the Steane code.

Item Type:


Identification Number (DOI):


Additional Information:

This work was supported by EPSRC grants EP/N003829/1 and
EP/M013243/1. Matty J Hoban also acknowledges funding from the EPSRC grant Building Large Quantum States out of Light (EP/K034480/1).


Experimental quantum computing technologies, Quantum computations, Verification, Protocols

Departments, Centres and Research Units:



6 November 2018Accepted
27 November 2018Published

Item ID:


Date Deposited:

07 Dec 2018 11:25

Last Modified:

27 Oct 2019 02:26

Peer Reviewed:

Yes, this version has been peer-reviewed.



View statistics for this item...

Edit Record Edit Record (login required)