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}).

翻译：近期，Sato等人通过引入第三方仲裁者提出了一种公开可验证的盲量子计算协议。然而，该协议并非真正意义上的公开可验证，因为仲裁者需预先确定并全程参与计算过程。本文提出了一种针对测量型盲量子计算的公开可验证协议。通过测量二色可着图图态的纠缠见证，估算任意态与图态之间的保真度，从而验证所制备图态的正确性。与先前协议相比，本协议允许随机客户端执行公开验证，实现了真正意义上的公开可验证。同时，本协议在效率方面具有更大优势，其中局域测量次数为O(n³log n)，图态副本数量为O(n²log n)。