%0 Generic %1 Broadbent2008 %A Broadbent, Anne %A Fitzsimons, Joseph %A Kashefi, Elham %D 2008 %K QC complexity imported %T Universal blind quantum computation %U http://arxiv.org/abs/0807.4154 %X 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.

@misc{Broadbent2008, 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 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. }, added-at = {2009-05-07T22:51:37.000+0200}, author = {Broadbent, Anne and Fitzsimons, Joseph and Kashefi, Elham}, biburl = {https://www.bibsonomy.org/bibtex/2e6d814accb998ad2d80ab8d1676f8550/ggiedke}, description = {Universal blind quantum computation}, interhash = {190fbede2c2d5c3ce39ddddbfcc1b887}, intrahash = {e6d814accb998ad2d80ab8d1676f8550}, keywords = {QC complexity imported}, note = {cite arxiv:0807.4154 Comment: 16 pages, 7 figures. This version contains a more detailed security proof and expanded authentication protocol. Section 5 contains news results: we prove that any problem in BQP has an entangled two-prover interactive proof with the provers being restricted to BQP and a purely classical verifier}, timestamp = {2009-05-07T22:51:37.000+0200}, title = {Universal blind quantum computation}, url = {http://arxiv.org/abs/0807.4154}, year = 2008 }