pith. sign in

arxiv: 1809.06000 · v2 · pith:HDPPRHSJnew · submitted 2018-09-17 · 🪐 quant-ph

A Hybrid and Universal Blind Quantum Computation

classification 🪐 quant-ph
keywords quantumentangleduniversalclientcomputationgatesblindchallenge
0
0 comments X
read the original abstract

In blind quantum computation (BQC), a client delegates her quantum computation to a server with universal quantum computers who learns nothing about the client's private information. In measurement-based BQC model, entangled states are generally used to realize quantum computing. However, to generate a large-scale entangled state in experiment becomes a challenge issue. In circuit-based BQC model, single-qubit gates can be realized precisely, but entangled gates are probabilistically successful. This remains a challenge to realize entangled gates with a deterministic method in some systems. To solve above two problems, we propose the first hybrid universal BQC protocol based on measurements and circuits, where the client prepares single-qubit states and the server performs universal quantum computing. We analyze and prove the correctness, blindness and verifiability of the proposed protocol.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.