Universal Blind Quantum Computation

By Anne Broadbent, Joseph Francis Fitzsimons, Elham Kashefi. 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 2008

777 citations recorded by the source corpus.

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 server; our scheme can also be made fault-tolerant. We also generalize our result to the setting of a purely classical client who communicates classically with two non-communicating entangled servers, in order to perform a blind quantum computation. By incorporating the authentication protocol, we show that any problem in BQP has an entangled two-prover interactive proof with a purely classical verifier. Our protocol is the first universal scheme which detects a cheating server, as well as the first protocol which does not require any quantum computation whatsoever on the client's side. The novelty of our approach is in using the unique features of measurement-based quantum computing which allows us to clearly distinguish between the quantum and classical aspects of a quantum computation.

Subfields: Artificial Intelligence, Atomic and Molecular Physics, and Optics

View Paper: https://www.semanticscholar.org/paper/ace672c3dddd5072e44cbef025e5739539620041

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Atomic and Molecular Physics, and Optics

Citations in the corpus

Development of Quantum Interconnects (QuICs) for Next-Generation Information Technologies (2021, background): “Of particular relevance is the possibility of “blind” quantum computation [50], [51], whereby a remote user can program a quantum computer without revealing to its owner the algorithm that is run or the computational result, and distributed quantum processing, whereby two or more quantum computers”
Efficient representation of quantum many-body states with deep neural networks (2017, neutral): “To construct this state, we start from a brickwork of white circles [32] (the left top side), with each white circle represented by seven blue circles.”
Quantum computational supremacy (2017, methodology): “This is exempliﬁed by the model of blind quantum computation, 14 which requires the veriﬁer to be able to create single-qubit states and send them to the prover.”
Quantum technology for military applications (2021, background): “2); - Quantum information transmission between quantum computers or quantum computing clusters at large distances or for sharing of remote quantum capabilities; - Blind quantum computing [69, 70] allowing to transmit a quantum algorithm to quantum computer, perform computations and retrieve results ”
A link layer protocol for quantum networks (2019, background): “[20] Anne Broadbent, Joseph Fitzsimons, and Elham Kashefi.”
Photonic quantum information processing: a review (2018, methodology): “From 2009 several other BQC protocols have been proposed, which may be classified according to the number of servers employed [457]: single-server BQC protocols [454, 455, 458–472], where Alice is capable to generate quant um states and distribute them to Bob, two-server [456, 457, 473] and three-se”
How "Quantum" is the D-Wave Machine? (2014, background): “At a high level, the nature of this argument is very interesting, and reminiscent of the algorithmic approaches in [2, 18, 9, 14, 5].”