Public verifiable measurement-only blind quantum computation based on entanglement witnesses

TL;DR

This paper introduces a truly public verifiable measurement-only blind quantum computation protocol that uses entanglement witnesses for state verification, enhancing transparency and efficiency over previous methods.

Contribution

It presents a novel protocol that enables multiple clients to publicly verify quantum computations using entanglement witnesses, improving transparency and efficiency.

Findings

Protocol allows multiple clients to verify quantum states publicly.

Uses entanglement witnesses to estimate fidelity of graph states.

Achieves efficiency with O(n^3 log n) measurements and O(n^2 log n) state copies.

Abstract

Recently, Sato et al. proposed an public verifiable blind quantum computation (BQC) protocol by inserting a third-party arbiter. However, it is not true public verifiable in a sense, because the arbiter is determined in advance and participates in the whole process. In this paper, a public verifiable protocol for measurement-only BQC is proposed. The fidelity between arbitrary states and the graph states of 2-colorable graphs is estimated by measuring the entanglement witnesses of the graph states,so as to verify the correctness of the prepared graph states. Compared with the previous protocol, our protocol is public verifiable in the true sense by allowing other random clients to execute the public verification. It also has greater advantages in the efficiency, where the number of local measurements is O(n^3*log {n}) and graph states' copies is O(n^2*log{n}).