Blind topological measurement-based quantum computation

  title={Blind topological measurement-based quantum computation},
  author={Tomoyuki Morimae and Keisuke Fujii},
  journal={Nature Communications},
  • T. Morimae, K. Fujii
  • Published 25 October 2011
  • Computer Science, Physics
  • Nature Communications
Blind quantum computation is a novel secure quantum-computing protocol that enables Alice, who does not have sufficient quantum technology at her disposal, to delegate her quantum computation to Bob, who has a fully fledged quantum computer, in such a way that Bob cannot learn anything about Alice's input, output and algorithm. A recent proof-of-principle experiment demonstrating blind quantum computation in an optical system has raised new challenges regarding the scalability of blind quantum… 
Blind Quantum Signature with Blind Quantum Computation
A blind quantum signature scheme is designed with laconic structure, which provides a potential practical application for e-commerce in the cloud computing and first-generation quantum computation.
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.
Remote Blind State Preparation with Weak Coherent Pulses in the Field.
The results prove the feasibility of UBQC over long distances, and thus serves as a key milestone towards secure cloud quantum computing.
Blinding quantum computation using alternative sources
This analysis shows that a heralded single-photon source can significantly improve the transmitted distance of UBQC and a modified coherent source can reduce the required transmitted number of pulses, and the finite-data-size effect is studied, which is a crucial for real-world applications.
A hybrid universal blind quantum computation
Robustness and device independence of verifiable blind quantum computing
The robustness of the single server verifiable universal blind quantum computing protocol of Fitzsimons and Kashefi is proved in the most general scenario and the composition of this protocol with a device-independent state tomography protocol that is based on the rigidity of CHSH games as proposed by Reichardt et al.
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 computation with a noise channel
An anti-noise BQC protocol is described, which combined the ideas of faithful distribution of single-photon state in collective noise, the feasible quantum nondemolition measurement and Broadbent-Fitzsimons-Kashefi (BFK) protocol.
Gate Teleportation-based Universal Blind Quantum Computation
The blindness and correctness of GTUBQC are proved, and the approach is applied to other types of computational tasks, such as quantum Fourier transform, to solve the challenge to directly encrypt quantum algorithms in circuits model.


Blind quantum computation protocol in which Alice only makes measurements
This work proposes another type of blind computing protocol where Alice does only measurements, such as the polarization measurements with a threshold detector, and the security of the protocol is based on the no-signaling principle, which is more fundamental than quantum physics.
Demonstration of Blind Quantum Computing
An experimental demonstration of blind quantum computing in which the input, computation, and output all remain unknown to the computer is presented and the conceptual framework of measurement-based quantum computation that enables a client to delegate a computation to a quantum server is exploited.
Blind quantum computing with weak coherent pulses.
The concept of ϵ blindness for UBQC is introduced, in analogy to the concept ofπ security developed for other cryptographic protocols, allowing us to characterize the robustness and security properties of the protocol under possible imperfections.
Universal Blind Quantum Computation
The 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.
Towards fault-tolerant quantum computing with trapped ions
Like their classical counterparts, quantum computers can, in theory, cope with imperfections—provided that these are small enough. The regime of fault-tolerant quantum computing has now been reached
Universal quantum computation with ideal Clifford gates and noisy ancillas (14 pages)
We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state |0>, and qubit measurement in the computational basis.
Experimental demonstration of topological error correction
This work demonstrates the viability of topological error correction for fault-tolerant quantum information processing and shows that a correlation can be protected against a single error on any quantum bit.
Universal fault tolerant quantum computation on bilinear nearest neighbor arrays
A rigorous lower bound to the fault tolerant threshold for this array is determined in a number of physical settings to enable universal fault tolerant quantum computation under the [[7, 1, 3]] quantum code.
Fault tolerant quantum computation with nondeterministic gates.
In certain approaches to quantum computing the operations between qubits are nondeterministic and likely to fail. For example, a distributed quantum processor would achieve scalability by networking
Fault-tolerant quantum computation with local gates
It is shown that a threshold result still exists in three, two, or one spatial dimensions when next-to-nearest-neighbour gates are available, and explicit constructions are presented.