Verifiable Measurement-Only Blind Quantum Computing with Stabilizer Testing.

@article{Hayashi2015VerifiableMB,
  title={Verifiable Measurement-Only Blind Quantum Computing with Stabilizer Testing.},
  author={Masahito Hayashi and Tomoyuki Morimae},
  journal={Physical review letters},
  year={2015},
  volume={115 22},
  pages={
          220502
        }
}
We introduce a simple protocol for verifiable measurement-only blind quantum computing. Alice, a client, can perform only single-qubit measurements, whereas Bob, a server, can generate and store entangled many-qubit states. Bob generates copies of a graph state, which is a universal resource state for measurement-based quantum computing, and sends Alice each qubit of them one by one. Alice adaptively measures each qubit according to her program. If Bob is honest, he generates the correct graph… 
View on PubMed
arxiv.org
130 Citations
Highly Influential Citations
6
Background Citations
34
Methods Citations
20
Results Citations
3

Figures and Tables from this paper

130 Citations

Citation Type

Citation Type

Verifiable delegated quantum computation with χ-type entangled states
Quantum state and circuit distinguishability with single-qubit measurements
TLDR
It is shown that the Quantum State Distinguishability (QSD), which is a QSZK-complete problem, and the Quantum Circuit Distinguishment (QCD) can be solved by the verifier who can perform only single-qubit measurements.
A hybrid universal blind quantum computation
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.
Blind quantum computing can always be made verifiable
TLDR
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.
Measurement-only verifiable blind quantum computing with quantum input verification
TLDR
This work introduces a protocol of measurement-only verifiable blind quantum computing where the correctness of the quantum input is also verifiable.
Measurement-based universal blind quantum computation with minor resources
TLDR
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.
Gate Teleportation-based Universal Blind Quantum Computation
TLDR
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.
Secure Two-Party Computation Based on Blind Quantum Computation
TLDR
This paper simplifies the QYao protocol and reduces Bob’s quantum capability by applying blind quantum computing (BQC) in 2PQC and improves the verification capability of Bob based on the method of stabilizer testing and further reduces Bob's ability to make measurements only.
Quantum Shell Games: How to Classically Delegate the Preparation of Authenticated Quantum States
TLDR
Novel protocols for verifiable, classically instructed remote state preparation and a case study on the security of magic boxes against adversaries as a first step toward proving security of the Shell Game against active adversaries.
...
...

References

SHOWING 1-10 OF 36 REFERENCES
Secure entanglement distillation for double-server blind quantum computation.
TLDR
This Letter shows that it is possible to perform entanglement distillation in the double-server scheme without degrading the security of blind quantum computing.
Verification for measurement-only blind quantum computing
TLDR
This paper proposes a protocol of verification for the measurement-only blind quantum computing, a new secure quantum computing protocol where a client who does not have any sophisticated quantum technlogy can delegate her quantum computing to a server without leaking any privacy.
Continuous-variable blind quantum computation.
  • T. Morimae
  • Computer Science, Physics
    Physical review letters
  • 2012
TLDR
It is shown that blind quantum computation is possible for the infinite squeezing case and that the finite squeezing causes no additional problem in the blind setup apart from the one inherent to the continuous-variable measurement-based quantum computation.
Universal Blind Quantum Computation
TLDR
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.
Blind topological measurement-based quantum computation
TLDR
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.
Device-Independent Verifiable Blind Quantum Computation
TLDR
This work presents a novel approach based on a combination of verified blind quantum computation and Bell state self-testing that has dramatically reduced overhead, with resources scaling as only O(m4lnm) in the number of gates.
Triple-server blind quantum computation using entanglement swapping
TLDR
A triple-server blind computation protocol where the client can delegate quantum computation to three quantum servers by the use of entanglement swapping and the client is almost classical since one does not require any quantum computational power, quantum memory, and the ability to prepare any quantum states and only needs to be capable of getting access to quantum channels.
Blind quantum computing with weak coherent pulses.
TLDR
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.
Ancilla-Driven Universal Blind Quantum Computation
TLDR
The possibility and the limitation of blind quantum computation in the ancilla-driven model, which is a hybrid of the circuit and the measurement-based models, are considered.
Ground state blind quantum computation on AKLT state
TLDR
A new scheme for BQC is presented that uses the concept of the measurement based quantum computing with the novel resource state of Affleck-Kennedy-Lieb-Tasaki (AKLT) chains leading to more robust computation.
...
...