Robustness and device independence of verifiable blind quantum computing

@article{Gheorghiu2015RobustnessAD,
  title={Robustness and device independence of verifiable blind quantum computing},
  author={Alexandru Gheorghiu and Elham Kashefi and Petros Wallden},
  journal={New Journal of Physics},
  year={2015},
  volume={17}
}
Recent advances in theoretical and experimental quantum computing bring us closer to scalable quantum computing devices. This makes the need for protocols that verify the correct functionality of quantum operations timely and has led to the field of quantum verification. In this paper we address key challenges to make quantum verification protocols applicable to experimental implementations. We prove the robustness of the single server verifiable universal blind quantum computing protocol of… 

Optimised resource construction for verifiable quantum computation

TLDR
A new construction that simplifies the required resources for any such verifiable protocol, and is generic and could be applied to any universal or non-universal scheme with a given underlying graph.

Simple and tight device-independent security proofs

TLDR
A flexible protocol is provided and a security proof is given that provides quantitative bounds that are asymptotically tight, even in the presence of general quantum adversaries, which is likely that these protocols can be practically implemented in the near future.

qu an tph ] 2 6 M ar 2 01 9 Simple and tight device-independent security proofs

TLDR
A flexible protocol is provided and a security proof is given that provides quantitative bounds that are asymptotically tight, even in the presence of general quantum adversaries, which is likely that these protocols can be practically implemented in the near future.

Unconditionally verifiable blind quantum computation

TLDR
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.

Improved Resource State for Verifiable Blind Quantum Computation

TLDR
This work presents a novel construction for the resource state of verifiable blind quantum computation that achieves a better verifiability of 0.866 in the case of classical output and utilizes the method of repetition and fault-tolerant code to optimise the verifiable.

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.

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.

A simple protocol for fault tolerant verification of quantum computation

TLDR
This paper presents a simple protocol for verifying quantum computations, in the presence of noisy devices, with no extra assumptions, based on post hoc techniques for verification, which allow for the prover to know the desired quantum computation and its input.

Efficient verification of universal and intermediate quantum computing

TLDR
This thesis proposes a verification protocol for the One-Pure-Qubit computer [Knill and Laflamme, 1998], which tolerates noise and is capable of computing hard problems such as large matrix trace estimation.
...

References

SHOWING 1-10 OF 48 REFERENCES

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.

Unconditionally verifiable blind quantum computation

TLDR
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.

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.

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.

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.

Multipartite entanglement verification resistant against dishonest parties.

TLDR
This Letter shows how an agent of a quantum network can perform a distributed verification of a source creating multipartite Greenberger-Horne-Zeilinger states with minimal resources, which is, nevertheless, resistant against any number of dishonest parties.

Deterministic entanglement distillation for secure double-server blind quantum computation

TLDR
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.

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.

Verifiable Measurement-Only Blind Quantum Computing with Stabilizer Testing.

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

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.