Measurement-based universal blind quantum computation with minor resources

TL;DR

This paper introduces a measurement-based universal blind quantum computation protocol that requires fewer resources and entangled qubits, enabling a nearly classical client to securely delegate quantum tasks with verification.

Contribution

It presents a novel BQC protocol using minimal resources and a lattice of small cluster states, reducing qubit requirements compared to previous methods.

Findings

Protocol ensures blindness, correctness, and universality.

Uses fewer qubits than traditional brickwork states.

Provides a verification mechanism via trap technology.

Abstract

Blind quantum computation (BQC) enables a client with less quantum computational ability to delegate her quantum computation to a server with strong quantum computational power while preserving the client's privacy. Generally, many-qubit entangled states are often used to complete BQC tasks. But for a large-scale entangled state, it is difficult to be described since its Hilbert space dimension is increasing exponentially. Furthermore, the number of entangled qubits is limited in experiment of existing works. To tackle this problem, in this paper we propose a universal BQC protocol based on measurement with minor resources, where the trap technology is adopted to verify correctness of the server's measurement outcomes during computation and testing process. In our model there are two participants, a client who prepares initial single-qubit states and a server that performs universal quantum computation. The client is almost classical since she does not require any quantum computational power, quantum memory. To realize the client's universal BQC, we construct an $m\times n$ latticed state composed of six-qubit cluster states and eight-qubit cluster states, which needs less qubits than the brickwork state. Finally, we analyze and prove the blindness, correctness, universality and verifiability of our proposed BQC protocol.