Fault-Tolerant Operations for Universal Blind Quantum Computation

被引:17
作者
Chien, Chia-Hung [1 ]
Van Meter, Rodney [2 ]
Kuo, Sy-Yen [1 ]
机构
[1] Natl Taiwan Univ, Dept Elect Engn, Taipei, Taiwan
[2] Keio Univ, Fac Environm & Informat Studies, Tokyo 108, Japan
基金
日本学术振兴会;
关键词
Blind quantum computation; quantum error correction; fault-tolerant quantum computation; measurement-based quantum computation; NETWORKS;
D O I
10.1145/2700248
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Blind quantum computation is an appealing use of quantum information technology because it can conceal both the client's data and the algorithm itself from the server. However, problems need to be solved in the practical use of blind quantum computation and fault-tolerance is a major challenge. Broadbent et al. proposed running error correction over blind quantum computation, and Morimae and Fujii proposed using fault-tolerant entangled qubits as the resource for blind quantum computation. Both approaches impose severe demands on the teleportation channel, the former requiring unrealistic data rates and the latter near-perfect fidelity. To extend the application range of blind quantum computation, we suggest that Alice send input qubits encoded with error correction code instead of single input qubits. Two fault-tolerant protocols are presented and we showed the trade-off of the computational overhead using the ten-bit quantum carry-lookahead adder as an example. Though these two fault-tolerant protocols require the client to have more quantum computing ability than using approaches from prior work, they provide better fault-tolerance when the client and the server are connected by realistic quantum repeater networks.
引用
收藏
页数:26
相关论文
共 40 条
[1]  
Aharonov Dorit, 2008, INTERACTIVE PROOFS Q
[2]  
[Anonymous], 2009, INTRO QUANTUM ERROR
[3]  
[Anonymous], 2008, QUANTUM ALGORITHMS
[4]   Blind quantum computation [J].
Arrighi, Pablo ;
Salvail, Louis .
INTERNATIONAL JOURNAL OF QUANTUM INFORMATION, 2006, 4 (05) :883-898
[5]   Recent Progress in Quantum Algorithms [J].
Bacon, Dave ;
van Dam, Wim .
COMMUNICATIONS OF THE ACM, 2010, 53 (02) :84-93
[6]   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
[7]   Efficient networks for quantum factoring [J].
Beckman, D ;
Chari, AN ;
Devabhaktuni, S ;
Preskill, J .
PHYSICAL REVIEW A, 1996, 54 (02) :1034-1063
[8]   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
[9]  
Childs AM, 2005, QUANTUM INF COMPUT, V5, P456
[10]   Determinism in the one-way model [J].
Danos, Vincent ;
Kashefi, Elham .
PHYSICAL REVIEW A, 2006, 74 (05)