中国物理B ›› 2022, Vol. 31 ›› Issue (5): 50305-050305.doi: 10.1088/1674-1056/ac2f34

• • 上一篇    下一篇

Analysis and improvement of verifiable blind quantum computation

Min Xiao(肖敏) and Yannan Zhang(张艳南)   

  1. 1 College of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065, China;
    2 Chongqing Key Laboratory of Cyberspace and Information Security, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
  • 收稿日期:2021-07-05 修回日期:2021-10-09 出版日期:2022-05-14 发布日期:2022-04-09
  • 通讯作者: Min Xiao,E-mail:xiaomin@cqupt.edu.cn E-mail:xiaomin@cqupt.edu.cn

Analysis and improvement of verifiable blind quantum computation

Min Xiao(肖敏)† and Yannan Zhang(张艳南)   

  1. 1 College of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065, China;
    2 Chongqing Key Laboratory of Cyberspace and Information Security, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
  • Received:2021-07-05 Revised:2021-10-09 Online:2022-05-14 Published:2022-04-09
  • Contact: Min Xiao,E-mail:xiaomin@cqupt.edu.cn E-mail:xiaomin@cqupt.edu.cn
  • About author:2021-10-13

RichHTML

2

PDF (PC)

90

赞

摘要： In blind quantum computation (BQC), a client with weak quantum computation capabilities is allowed to delegate its quantum computation tasks to a server with powerful quantum computation capabilities, and the inputs, algorithms and outputs of the quantum computation are confidential to the server. Verifiability refers to the ability of the client to verify with a certain probability whether the server has executed the protocol correctly and can be realized by introducing trap qubits into the computation graph state to detect server deception. The existing verifiable universal BQC protocols are analyzed and compared in detail. The XTH protocol (proposed by Xu Q S, Tan X Q, Huang R in 2020), a recent improvement protocol of verifiable universal BQC, uses a sandglass-like graph state to further decrease resource expenditure and enhance verification capability. However, the XTH protocol has two shortcomings: limitations in the coloring scheme and a high probability of accepting an incorrect computation result. In this paper, we present an improved version of the XTH protocol, which revises the limitations of the original coloring scheme and further improves the verification ability. The analysis demonstrates that the resource expenditure is the same as for the XTH protocol, while the probability of accepting the wrong computation result is reduced from the original minimum (0.866)d* to (0.819)d*, where d* is the number of repeated executions of the protocol.

关键词: verifiable blind quantum computation, universal blind quantum computation, measurement-based quantum computation

Abstract: In blind quantum computation (BQC), a client with weak quantum computation capabilities is allowed to delegate its quantum computation tasks to a server with powerful quantum computation capabilities, and the inputs, algorithms and outputs of the quantum computation are confidential to the server. Verifiability refers to the ability of the client to verify with a certain probability whether the server has executed the protocol correctly and can be realized by introducing trap qubits into the computation graph state to detect server deception. The existing verifiable universal BQC protocols are analyzed and compared in detail. The XTH protocol (proposed by Xu Q S, Tan X Q, Huang R in 2020), a recent improvement protocol of verifiable universal BQC, uses a sandglass-like graph state to further decrease resource expenditure and enhance verification capability. However, the XTH protocol has two shortcomings: limitations in the coloring scheme and a high probability of accepting an incorrect computation result. In this paper, we present an improved version of the XTH protocol, which revises the limitations of the original coloring scheme and further improves the verification ability. The analysis demonstrates that the resource expenditure is the same as for the XTH protocol, while the probability of accepting the wrong computation result is reduced from the original minimum (0.866)d* to (0.819)d*, where d* is the number of repeated executions of the protocol.

Key words: verifiable blind quantum computation, universal blind quantum computation, measurement-based quantum computation

中图分类号:  (Quantum computation architectures and implementations)

  • 03.67.Lx
03.67.Dd (Quantum cryptography and communication security) 03.65.Ta (Foundations of quantum mechanics; measurement theory)