Verification for measurement-only blind quantum computing

  title={Verification for measurement-only blind quantum computing},
  author={Tomoyuki Morimae},
  journal={arXiv: Quantum Physics},
  • T. Morimae
  • Published 7 August 2012
  • Computer Science
  • arXiv: Quantum Physics
Blind quantum computing is 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. It is known that a client who has only a measurement device can perform blind quantum computing [T. Morimae and K. Fujii, Phys. Rev. A {\bf87}, 050301(R) (2013)]. It has been an open problem whether the protocol can enjoy the verification, i.e., the ability of client to check the… 

Figures from this paper

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.

Measurement-only verifiable blind quantum computing with quantum input verification

This work introduces a protocol of measurement-only verifiable blind quantum computing where the correctness of the quantum input is also verifiable.

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.

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.

Demonstration of measurement-only blind quantum computing

A proof-of-principle implementation of this measurement-only blind quantum computing, exploiting a photonic setup to generate four-qubit cluster states for computation and verification.

Single-server blind quantum computation with quantum circuit model

A single-server BQC protocol with quantum circuit model is proposed by replacing any quantum gate with the combination of rotation operators, such that the server is unknown about quantum algorithms.

Universal single-server blind quantum computation for classical clients

An analysis of this protocol is presented and a new ‘Cloud + Certificate Authority (CA)’ style is proposed for the BQC, which is modified to a universal single-server and fully-classical-client BZC protocol by improving the ability of the trusted center.

A hybrid universal blind quantum computation

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.

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.



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.

Optimal Blind Quantum Computation

This work presents general techniques for upper and lower bounding the quantum communication necessary to perform blind quantum computation, and uses these techniques to establish concrete bounds for common choices of the client's quantum capabilities.

Unconditionally verifiable blind computation

This paper rigorously proves that the probability of detecting an incorrect output is exponentially small in a security parameter, while resource overhead remains polynomial in this parameter, which is a significant improvement on the original BQC scheme, which required that all computations to be performed must first be put into a nearest neighbour form.

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.

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.

Composable Security of Delegated Quantum Computation

This work defines composable security for delegated quantum computation, and distinguishes between protocols which provide only blindness – the computation is hidden from the server – and those that are also verifiable – the client can check that it has received the correct result.

Experimental verification of quantum computation

A protocol for testing a quantum computer using minimum quantum resources has been proposed and demonstrated and Alice can verify the result of a quantum computation that she has delegated to Bob without using a quantumComputer.

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.

Quantum computation: Honesty test

Alice does not have a quantum computer so she delegates a computation to Bob, who does own one. But how can Alice check whether the computation that Bob performs for her is correct? An experiment

Device-independent security of quantum cryptography against collective attacks.

The main result is a tight bound on the Holevo information between one of the authorized parties and the eavesdropper, as a function of the amount of violation of a Bell-type inequality.