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

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

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

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.

Garbled Quantum Computation

This contribution explores the possibility of extending the verifiable UBQC, and presents a “Yao”-type protocol for secure two-party quantum computation that is secure against a specious (quantum honest-but-curious) garbler, but in this case, against a (fully) malicious evaluator.

Unconditionally verifiable blind quantum computation

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

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

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

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.

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.

Client-friendly continuous-variable blind and verifiable quantum computing

This research presents a novel and scalable approach called "Smart grids for smart cities" that combines smart grids, smart cities, and smart grids in the context of a city-state.
...

References

SHOWING 1-10 OF 46 REFERENCES

Blind topological measurement-based quantum computation

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

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

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.

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.

Verification for measurement-only blind quantum computing

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.

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.

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

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.

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