Continuous-variable blind quantum computation

TL;DR

This paper demonstrates that blind quantum computation can be achieved using continuous-variable measurement-based models, including cases with finite squeezing, expanding the scope of secure delegated quantum computing protocols.

Contribution

It introduces the possibility of blind quantum computation in continuous-variable models, including finite squeezing scenarios, which were not previously established.

Findings

Blind quantum computation is possible for the infinite squeezing case.

Finite squeezing does not introduce additional problems beyond those inherent to continuous-variable models.

Abstract

Blind quantum computation is a secure delegated quantum computing protocol where Alice who does not have sufficient quantum technology at her disposal delegates her 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. Protocols of blind quantum computation have been proposed for several qubit measurement-based computation models, such as the graph state model, the Affleck-Kennedy-Lieb-Tasaki model, and the Raussendorf-Harrington-Goyal topological model. Here, we consider blind quantum computation for the continuous-variable measurement-based model. We show that blind quantum computation is possible for the infinite squeezing case. We also show that the finite squeezing causes no additional problem in the blind setup apart from the one inherent to the continuous-variable measurement-based quantum computation.