Verifiable distributed blind quantum computation

被引:0
作者
Xiong, Wenbiao [1 ]
Junyu, Quan [1 ]
Xie, Xingjia [1 ]
Zhu, Jiang [1 ]
Li, Qin [1 ]
机构
[1] Xiangtan Univ, Sch Comp Sci, Xiangtan 411105, Peoples R China
关键词
blind quantum computation; distributed quantum computation; delegated quantum computation; verifiable quantum computation;
D O I
10.1360/SSPMA-2024-0133
中图分类号
P1 [天文学];
学科分类号
0704 ;
摘要
Blind quantum computation (BQC) enables clients with limited quantum capabilities to delegate computational tasks to remote quantum servers while maintaining the privacy of inputs, outputs, and algorithms. However, in the NISQ era, servers cannot perform large-scale quantum computing tasks due to the constraints of the size and performance of quantum computers. Therefore, this paper proposes a distributed BQC protocol based on the measurement model to increase the possibility of implementing some tasks of larger size. The proposed protocol divides the brickwork resource states into two types of small-scale quantum resource states, which are subsequently entangled by using the optimized non-local CZ operations to construct a larger-scale quantum resource state. This approach can significantly reduce the burden on a single quantum server. Notably, the implementation of the optimized non-local CZ operation only requires pre-sharing a pair of Bell states without the need for classical communication between servers, which may boost the parallelism of delegated computation. In addition, the protocol also realizes verifiability by embedding trap qubits. Finally, a replacement strategy for any quantum server is suggested in anticipation of possible periodic maintenance of quantum servers in the future.
引用
收藏
页数:11
相关论文
共 27 条
[1]   Demonstration of Blind Quantum Computing [J].
Barz, Stefanie ;
Kashefi, Elham ;
Broadbent, Anne ;
Fitzsimons, Joseph F. ;
Zeilinger, Anton ;
Walther, Philip .
SCIENCE, 2012, 335 (6066) :303-308
[2]   Universal Blind Quantum Computation [J].
Broadbent, Anne ;
Fitzsimons, Joseph ;
Kashefi, Elham .
2009 50TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE: FOCS 2009, PROCEEDINGS, 2009, :517-526
[3]  
Childs AM, 2005, QUANTUM INF COMPUT, V5, P456
[4]   Determinism in the one-way model [J].
Danos, Vincent ;
Kashefi, Elham .
PHYSICAL REVIEW A, 2006, 74 (05)
[5]   Unconditionally verifiable blind quantum computation [J].
Fitzsimons, Joseph F. ;
Kashefi, Elham .
PHYSICAL REVIEW A, 2017, 96 (01)
[6]   Private quantum computation: an introduction to blind quantum computing and related protocols [J].
Fitzsimons, Joseph F. .
NPJ QUANTUM INFORMATION, 2017, 3
[7]   Anonymous blind quantum computation protocol for distributed quantum networks [J].
Gao, Dong-Mei ;
Yang, Yu-Guang .
SCIENTIA SINICA-PHYSICA MECHANICA & ASTRONOMICA, 2023, 53 (05)
[8]   Robustness and device independence of verifiable blind quantum computing [J].
Gheorghiu, Alexandru ;
Kashefi, Elham ;
Wallden, Petros .
NEW JOURNAL OF PHYSICS, 2015, 17
[9]  
Grover L. K., 1996, Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, P212, DOI 10.1145/237814.237866
[10]   Quantum Algorithm for Linear Systems of Equations [J].
Harrow, Aram W. ;
Hassidim, Avinatan ;
Lloyd, Seth .
PHYSICAL REVIEW LETTERS, 2009, 103 (15)