|
|
|
Analysis and improvement of verifiable blind quantum computation |
| Min Xiao(肖敏)† and Yannan Zhang(张艳南) |
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 |
|
|
|
|
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.
|
Received: 05 July 2021
Revised: 09 October 2021
Accepted manuscript online:
|
|
PACS:
|
03.67.Lx
|
(Quantum computation architectures and implementations)
|
| |
03.67.Dd
|
(Quantum cryptography and communication security)
|
| |
03.65.Ta
|
(Foundations of quantum mechanics; measurement theory)
|
|
Corresponding Authors:
Min Xiao,E-mail:xiaomin@cqupt.edu.cn
E-mail: xiaomin@cqupt.edu.cn
|
| About author: 2021-10-13 |
Cite this article:
Min Xiao(肖敏) and Yannan Zhang(张艳南) Analysis and improvement of verifiable blind quantum computation 2022 Chin. Phys. B 31 050305
|
[1] Shor P W 2014 In Proceedings of 35th Annual Symposium on the Foundations of Computer Science, IEEE Computer Society Press, November 20, 1994 Los Alamitos, CA, USA, pp. 124-134
[2] Shor P W 1999 Siam. Rev. 41 303
[3] Grover L K 1996 arXiv:9607024[quant-ph]
[4] Morimae T and Fuji K 2013 Phys. Rev. A 87 3393
[5] Broadbent A, Fitzsimons J and Kashefi E 2009 0th Annual IEEE Symposium on Foundations of Computer Science (Atlanta:IEEE) p. 517
[6] Morimae T and Fuji K 2013 Phys. Rev. Lett. 111 47
[7] Li Q,Chan W H, Wu C H and Wen Z H 2014 Phys. Rev. A 89 2748
[8] Morimae T 2014 Phys. Rev. A 89 4085
[9] Hayashi M and Morimae T 2014 Phys. Rev. Lett. 115 220502
[10] McKague M 2016 Theor. Comput. 12 1
[11] Morimae T 2016 Phys. Rev. A 94 042301
[12] Fitzsimons J F and Kashefi E 2017 Phys. Rev. A 96 012303
[13] Kashefi E and Wallden P 2017 J. Phys. A: Math. Theor. 50 145306
[14] Xu Q S, Tan X Q and Huang R 2020 Entropy 22 996
[15] Childs A M 2005 Quantum Inf. & Comput. 5 456
[16] Arrighi P and Salvail L 2006 Int. J. Quantum Inf. 4 883
[17] Xu H R 2014 arXiv:1410.7054[quant-ph]
[18] Barz S, Kashefi E, Broadbent A, Fitzsimons J F, Zeilinger A and Walther, P 2012 APS March Meeting 2012, Monday-Friday, February 27-March 2, 2012, Boston, Massachusetts, p. T30-010
[19] Barz S, Fitzsimons J F, Kashefi E and Walther P 2013 Nat. Phys. 9 727
[20] Greganti C, Roehsner M C, Barz S, Morimae T and Walther P 2016 New J. Phys. 18 013020
[21] Huang H L, Zhao Q, Ma X, Liu C, Su Z E, Wang X L, Pan J W, Ma X F, Li L, Liu N L, Sanders B C and Lu C Y 2017 Phys. Rev. Lett. 119 050503
[22] Morimae T and Fujii K 2006 Nat. Commun. 3 1036
[23] Xiao M, Liu L and Song X L 2018 Quantum Inf. Process. 24 63
[24] Takeuchi Y, Fujii K, Ikuta R, Yamamoto T and Imoto N 2016 Phys. Rev. A 93 052307
[25] Chien C H, Meter R V and Kuo S Y 2015 Acm J. Emerg. Tech. Com. 12 1
[26] Raussendorf R, Harrington J and Goyal K 2007 New J. Phys. 9 199
[27] Fitzsimons J F 2017 npj Quantum Inf. 3 11 |
| No Suggested Reading articles found! |
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
Altmetric
|
|
blogs
Facebook pages
Wikipedia page
Google+ users
|
Online attention
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.
View more on Altmetrics
|
|
|
