Universal Blind Quantum Computation

  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},
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… 

Figures and Tables from this paper

Impossibility of blind quantum sampling for classical client

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.

Blind quantum computation for QFT on multi-qubit states

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.

Blind quantum computing can always be made verifiable

A plug-in is proposed that makes any universal blind quantum computing protocol automatically verifiable and blindly generates Feynman-Kitaev history states corresponding to the quantum circuit that solves client's problem and its complement circuit.

On the implausibility of classical client blind quantum computing

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).

Universal half-blind quantum computation

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.

Blind quantum computing with two almost identical states

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.

Multi-server Blind Quantum Computation Protocol With Limited Classical Communication Among Servers

  • Y. Sano
  • Computer Science
    Quantum Inf. Process.
  • 2022
Dummy gates and a circuit modeled after brickwork states play a crucial role in the new protocol and it is shown that it is possible to make estimates for risks that could not be estimated in a previous study.

Secure delegated quantum computation based on Z-rotation encryption

This work shows that as long as the client can prepare a fixed qubit and perform a fixed phase gate P, then he or she can still achieve the secure delegated quantum computation.

Experimental quantum homomorphic encryption

This work demonstrates homomorphic-encrypted quantum computing with unitary transformations of individual qubits, as well as multi-qubit quantum walk computations using single-photon states and non-birefringent integrated optics, and shows the potential for delegated quantum computing using photons.

Impossibility Of Perfectly-Secure Ono-Round Delegated Quantum Computing for classical client

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.



Authentication of quantum messages

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.

Fault-tolerant quantum computation with cluster states

Two threshold theorems are proved which show that scalable fault-tolerant quantum computation may be achieved in implementations based on cluster states, provided the noise in the implementations is below some constant threshold value.

Secure assisted quantum computation

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.

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 designated

Interactive Proofs For Quantum Computations

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.

The measurement calculus

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.

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 cluster

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,

Theory of quantum error-correcting codes

A general theory of quantum error correction based on encoding states into larger Hilbert spaces subject to known interactions is developed and necessary and sufficient conditions for the perfect recovery of an encoded state after its degradation by an interaction are obtained.

Private quantum channels

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.