Blind topological measurement-based quantum computation

TL;DR

This paper demonstrates that secure, fault-tolerant blind quantum computation is feasible using topological methods, with error thresholds comparable to non-blind schemes, making secure cloud quantum computing practically achievable.

Contribution

It introduces a topologically protected scheme for fault-tolerant blind quantum computation with a specific error threshold, advancing secure quantum cloud computing.

Findings

Error threshold of 0.0043 for blind quantum computation

Comparable error threshold to non-blind topological quantum computation

Experimental systems with 0.001 error per gate are sufficient for secure computation

Abstract

Blind quantum computation is a novel secure quantum-computing protocol that enables Alice, who does not have sufficient quantum technology at her disposal, to delegate her quantum computation to Bob, who has a fully fledged quantum computer, in such a way that Bob cannot learn anything about Alice's input, output and algorithm. A recent proof-of-principle experiment demonstrating blind quantum computation in an optical system has raised new challenges regarding the scalability of blind quantum computation in realistic noisy conditions. Here we show that fault-tolerant blind quantum computation is possible in a topologically protected manner using the Raussendorf-Harrington-Goyal scheme. The error threshold of our scheme is 0.0043, which is comparable to that (0.0075) of non-blind topological quantum computation. As the error per gate of the order 0.001 was already achieved in some experimental systems, our result implies that secure cloud quantum computation is within reach.