Secure entanglement distillation for double-server blind quantum computation.

@article{Morimae2013SecureED,
  title={Secure entanglement distillation for double-server blind quantum computation.},
  author={Tomoyuki Morimae and Keisuke Fujii},
  journal={Physical review letters},
  year={2013},
  volume={111 2},
  pages={
          020502
        }
}
  • T. MorimaeK. Fujii
  • Published 15 February 2013
  • Computer Science, Physics
  • Physical review letters
Blind quantum computation is a new secure quantum computing protocol where a client, who does not have enough quantum technologies at her disposal, can delegate her quantum computation to a server, who has a fully fledged quantum computer, in such a way that the server cannot learn anything about the client's input, output, and program. If the client interacts with only a single server, the client has to have some minimum quantum power, such as the ability of emitting randomly rotated single… 

Figures from this paper

Deterministic entanglement distillation for secure double-server blind quantum computation

This work provides a deterministic entanglement distillation protocol in a practical noisy environment for the double-server BQC protocol that can get the pure maximally entangled Bell state.

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.

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.

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.

Greenberger-Horne-Zeilinger states-based blind quantum computation with entanglement concentration

A novel BQC protocol based on maximally entangled Greenberger-Horne-Zeilinger (GHZ) states is proposed which doesn’t need a trusted center, where the client only needs to own quantum channels with two servers who have full-advantage quantum computers.

Measurement-based universal blind quantum computation with minor resources

This paper proposes a universal BQC protocol based on measurement with minor resources, where the trap technology is adopted to verify correctness of the server's measurement outcomes during computation and testing process, and analyzes and proves the blindness, correctness, universality and verifiability of this protocol.

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.

Blind quantum computation with hybrid model

A new BQC protocol with hybrid model is proposed, using the combination of rotation operators to construct arbitrary quantum gate, where the server can’t know which quantum gate has been teleported.

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.

Ancilla-driven blind quantum computation for clients with different quantum capabilities

Blind quantum computation (BQC) allows a client with limited quantum power to delegate his quantum computational task to a powerful server and still keep his input, output, and algorithm private.
...