Demonstration of Blind Quantum Computing

  title={Demonstration of Blind Quantum Computing},
  author={Stefanie Barz and Elham Kashefi and Anne Broadbent and Joseph Fitzsimons and Anton Zeilinger and Philip Walther},
  pages={303 - 308}
Quantum Blindness While quantum computers offer speed advantages over their classical counterparts, the technological challenges facing their eventual realization suggest that they will need to be located in specialized facilities. Thus, interaction would then need to be on a quantum client:quantum server basis. Barz et al. (p. 303; see the Perspective by Vedral) implemented a proof-of-principle protocol that illustrates complete security in such a setup—for both the client and the server. In… 

Verifiable blind quantum computation with identity authentication for different types of clients

This paper proposes three multi-party verifiable blind quantum computing (VBQC) protocols with identity authentication to handle clients with varying quantum capabilities in quantum networks, such as those who can just make measurements, prepare single qubits, or perform a few single-qubit gates.

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.

Unconditionally verifiable blind quantum computation

It is rigorously proved that the probability of failing to detect an incorrect output is exponentially small in a security parameter, while resource overhead remains polynomial in this parameter, which allows entangling gates to be performed between arbitrary pairs of logical qubits with only constant overhead.

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.

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.

Composable security of measuring-Alice blind quantum computation

Composable security of the measuring-Alice protocol is shown by using the formalism of the constructive cryptography to enable more intuitive and transparent proofs for the composable security.

Blind topological measurement-based quantum computation

This work shows that fault-tolerant blind quantum computation is possible in a topologically protected manner using the Raussendorf–Harrington–Goyal scheme, and implies that secure cloud quantum computations is within reach.

Experimental Blind Quantum Computing for a Classical Client.

This experiment implements a proof-of-principle experiment for completely classical clients that accomplishes the task of having the number 15 factorized by servers who are denied information about the computation itself.

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.

Universal blind quantum computation for hybrid system

Here, the first step is taken to construct a framework of blind quantum computation for the hybrid system, which provides a more feasible way for scalableblind quantum computation.



Measurement-based quantum computation

Quantum computation offers a promising new kind of information processing, where the non-classical features of quantum mechanics are harnessed and exploited. A number of models of quantum computation

A scheme for efficient quantum computation with linear optics

It is shown that efficient quantum computation is possible using only beam splitters, phase shifters, single photon sources and photo-detectors and are robust against errors from photon loss and detector inefficiency.

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.

Demonstration of an all-optical quantum controlled-NOT gate

An unambiguous experimental demonstration and comprehensive characterization of quantum CNOT operation in an optical system that produces all four entangled Bell states as a function of only the input qubits' logical values, for a single operating condition of the gate.

Experimental quantum private queries with linear optics

A variant of the quantum private query algorithm that admits a simple linear optical implementation: it employs the photon's momentum (or time slot) as address qubits and its polarization as bus qubit.

Measurement-based quantum computation beyond the one-way model

This work elaborates on the framework established in Gross and Eisert and discusses variants of Kitaev's toric code states as universal resources, and opens up a way of thinking of tailoring resource states to specific physical systems, such as cold atoms in optical lattices or linear optical systems.

Experimental one-way quantum computing

The implementation of Grover's search algorithm demonstrates that one-way quantum computation is ideally suited for such tasks.

Efficient quantum memory for light

A low-noise, highly efficient quantum memory for light that uses a solid-state medium that allows the storage and recall of light more faithfully than is possible using a classical memory, for weak coherent states at the single-photon level through to bright states of up to 500 photons.

High-speed linear optics quantum computing using active feed-forward

It is demonstrated that, for a perfect cluster state and no photon loss, the one-way quantum computation scheme would operate with good fidelity and that the feed-forward components function with very high speed and low error for detected photons.

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.