Universal Blind Quantum Computation

@article{Broadbent2009UniversalBQ,
  title={Universal Blind Quantum Computation},
  author={Anne Broadbent and Joseph Fitzsimons and Elham Kashefi},
  journal={2009 50th Annual IEEE Symposium on Foundations of Computer Science},
  year={2009},
  pages={517-526}
}
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… Expand
Impossibility of blind quantum sampling for classical client
TLDR
If a completely classical client can blindly delegate sampling of subuniversal models, such as the DQC1 model and the IQP model, then the polynomial-time hierarchy collapses to the third level. Expand
Blind quantum computation for QFT on multi-qubit states
TLDR
This article proposes a new BQC protocol of quantum fourier transform (QFT) performed on multi-qubit states with a trusted, a client and a server, where the trusted center can generate resource states and the client can delegate her quantum computing to a server who can perform universal quantum computing without knowing anything about the client's inputs, algorithms and outputs. Expand
On the Possibility of Classical Client Blind Quantum Computing
TLDR
Using the functionality of delegated pseudo-secret random qubit generator (PSRQG), a classical client can instruct the preparation of a sequence of random qubits at some distant party, one could achieve a purely classical-client computational secure verifiable delegated universal quantum computing (also referred to as verifiable blind quantum computation). Expand
Blind quantum computing can always be made verifiable
Blind quantum computing enables a client, who does not have enough quantum technologies, to delegate her quantum computing to a remote quantum server in such a way that her privacy is protectedExpand
On the implausibility of classical client blind quantum computing
TLDR
Using the functionality of delegated pseudo-secret random qubit generator (PSRQG), a classical client can instruct the preparation of a sequence of random qubits at some distant party, one could achieve a purely classical-client computational secure verifiable delegated universal quantum computing (also referred to as verifiable blind quantum computation). Expand
Universal half-blind quantum computation
TLDR
The protocol itself is half-blind, that is, Bob may learn which quantum gate he implements but nothing about Alice’s inputs and outputs, and Alice is only required to send qubits and perform Pauli gates. Expand
Multi-server Blind Quantum Computation Protocol With Limited Classical Communication Among Servers
TLDR
Dummy gates and a circuit modeled after brickwork states play a crucial role in the new protocol, by extend this two-server protocol to multiple servers, which remains secure even if some servers communicate with each other after the computation. Expand
Blind quantum computing with two almost identical states
TLDR
This work identifies sufficient criteria on the powers of the client, which still allow for secure blind quantum computation, in a universally composable framework, and provides a series of protocols, where each step reduces the number of differing states the client needs to be able to prepare. Expand
Flow ambiguity: A path towards classically driven blind quantum computation
TLDR
This work shows how a classical client can exploit the ambiguity in the flow of information in measurement-based quantum computing to construct a protocol for hiding critical aspects of a computation delegated to a remote quantum computer. Expand
Impossibility Of Perfectly-Secure Ono-Round Delegated Quantum Computing for classical client
TLDR
Here it is shown that the protocol cannot satisfy both the correctness and the perfect blindness simultaneously unless BQP is in NP, suggesting the impossibility of the one-round perfectly-secure delegated quantum computing. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 40 REFERENCES
Authentication of quantum messages
TLDR
A non-interactive scheme that enables A to both encrypt and authenticate an m qubit message by encoding it into m+s qubits, where the error probability decreases exponentially in the security parameter s, and a lower bound of 2m key bits for authenticating m qubits is given, which makes the protocol asymptotically optimal. Expand
Fault-tolerant quantum computation with cluster states
The one-way quantum computing model introduced by Raussendorf and Briegel [Phys. Rev. Lett. 86, 5188 (2001)] shows that it is possible to quantum compute using only a fixed entangled resource knownExpand
Secure assisted quantum computation
TLDR
A simple, efficient protocol is described by which Bob can help Alice perform the computation, but there is no way for him to learn anything about it. Expand
An introduction to measurement based quantum computation
In the formalism of measurement based quantum computation we start with a given fixed entangled state of many qubits and perform computation by applying a sequence of measurements to designatedExpand
Interactive Proofs For Quantum Computations
TLDR
Any language in BQP has a QPIP, and moreover, a fault tolerant one, and two proofs are provided: the simpler one uses a new (possibly of independent interest) quantum authentication scheme (QAS) based on random Clifford elements, which is not fault tolerant. Expand
The measurement calculus
TLDR
A rigorous mathematical model underlying the one-way quantum computer is developed and a concrete syntax and operational semantics for programs, which are called patterns, are presented, and an algebra of these patterns derived from a denotational semantics are presented. Expand
Measurement-based quantum computation on cluster states
We give a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the clusterExpand
Unified derivations of measurement-based schemes for quantum computation
We present unified, systematic derivations of schemes in the two known measurement-based models of quantum computation. The first model (introduced by Raussendorf and Briegel, [Phys. Rev. Lett. 86,Expand
Theory of quantum error-correcting codes
Quantum error correction will be necessary for preserving coherent states against noise and other unwanted interactions in quantum computation and communication. We develop a general theory ofExpand
Private quantum channels
TLDR
It is shown that in order to transmit n qubits privately, 2n bits of shared private key are necessary and sufficient and may be viewed as the quantum analogue of the classical one-time pad encryption scheme. Expand
...
1
2
3
4
...