Client-friendly continuous-variable blind and verifiable quantum computing
Nana Liu, Tommaso F. Demarie, Si-Hui Tan, Leandro Aolita, Joseph F., Fitzsimons

TL;DR
This paper introduces a practical, client-friendly protocol for blind and verifiable continuous-variable quantum computing that requires minimal Gaussian operations from the client and simple non-Gaussian resources from the server.
Contribution
It presents the first experimentally feasible CV quantum computing protocol that ensures blindness and verifiability with minimal client-side quantum capabilities.
Findings
Protocol is highly experimentally friendly for clients.
Server only needs to supply a single type of non-Gaussian state.
Verification uses efficient Gaussian measurements on injected states.
Abstract
We present a verifiable and blind protocol for assisted universal quantum computing on continuous-variable (CV) platforms. This protocol is highly experimentally-friendly to the client, as it only requires Gaussian-operation capabilities from the latter. Moreover, the server is not required universal quantum-computational power either, its only function being to supply the client with copies of a single-mode non-Gaussian state. Universality is attained based on state-injection of the server's non-Gaussian supplies. The protocol is automatically blind because the non-Gaussian resource requested to the server is always the same, regardless of the specific computation. Verification, in turn, is possible thanks to an efficient non-Gaussian state fidelity test where we assume identical state preparation by the server. It is based on Gaussian measurements by the client on the injected states,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
