Universal blind quantum computation
Anne Broadbent, Joseph Fitzsimons, Elham Kashefi

TL;DR
This paper introduces a universal blind quantum computation protocol enabling clients with minimal quantum capabilities to securely delegate quantum computations to servers, ensuring privacy, detection of cheating, and fault tolerance.
Contribution
It presents the first universal blind quantum computation scheme that detects cheating and requires no quantum computation from the client, using measurement-based quantum computing features.
Findings
Client can verify server honesty with authentication protocol
Protocol works for classical and quantum inputs/outputs
Scheme is fault-tolerant and universally applicable
Abstract
We present a protocol which allows a client to have a server carry out a quantum computation for her such that the client's inputs, outputs and computation remain perfectly private, and where she does not require any quantum computational power or memory. The client only needs to be able to prepare single qubits randomly chosen from a finite set and send them to the server, who has the balance of the required quantum computational resources. Our protocol is interactive: after the initial preparation of quantum states, the client and server use two-way classical communication which enables the client to drive the computation, giving single-qubit measurement instructions to the server, depending on previous measurement outcomes. Our protocol works for inputs and outputs that are either classical or quantum. We give an authentication protocol that allows the client to detect an interfering…
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.
