A Hybrid and Universal Blind Quantum Computation

TL;DR

This paper introduces a hybrid blind quantum computation protocol combining measurement-based and circuit-based models, enabling deterministic entangled gate implementation and enhancing practical universal quantum computing security.

Contribution

It presents the first hybrid universal BQC protocol that integrates measurement and circuit models, addressing entanglement generation and success probability issues.

Findings

Protocol is correct, blind, and verifiable.

Enables deterministic entangled gate implementation.

Combines measurement-based and circuit-based BQC advantages.

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.