Experimental demonstration of a graph state quantum error-correction code

被引:101
作者
Bell, B. A. [1 ]
Herrera-Marti, D. A. [2 ]
Tame, M. S. [3 ,4 ]
Markham, D. [5 ]
Wadsworth, W. J. [6 ]
Rarity, J. G. [1 ]
机构
[1] Univ Bristol, Dept Elect & Elect Engn, Ctr Commun Res, Bristol BS8 1UB, Avon, England
[2] Natl Univ Singapore, Ctr Quantum Technol, Singapore 117543, Singapore
[3] Univ KwaZulu Natal, Sch Chem & Phys, ZA-4001 Durban, South Africa
[4] Univ KwaZulu Natal, Natl Inst Theoret Phys, ZA-4001 Durban, South Africa
[5] Telecom ParisTech, Dept Informat & Reseaux, CNRS LTCI, F-75214 Paris 13, France
[6] Univ Bath, Dept Phys, Ctr Photon & Photon Mat, Bath BA2 7AY, Avon, England
来源
NATURE COMMUNICATIONS | 2014年 / 5卷
基金
英国工程与自然科学研究理事会; 新加坡国家研究基金会;
关键词
CLUSTER STATES; COMPUTATION; SCHEME; ENTANGLEMENT; REALIZATION; TOLERANCE;
D O I
10.1038/ncomms4658
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Scalable quantum computing and communication requires the protection of quantum information from the detrimental effects of decoherence and noise. Previous work tackling this problem has relied on the original circuit model for quantum computing. However, recently a family of entangled resources known as graph states has emerged as a versatile alternative for protecting quantum information. Depending on the graph's structure, errors can be detected and corrected in an efficient way using measurement-based techniques. Here we report an experimental demonstration of error correction using a graph state code. We use an all-optical setup to encode quantum information into photons representing a four-qubit graph state. We are able to reliably detect errors and correct against qubit loss. The graph we realize is setup independent, thus it could be employed in other physical settings. Our results show that graph state codes are a promising approach for achieving scalable quantum information processing.
引用
收藏
页数:10
相关论文
共 70 条
[1]  
Aharonov D., 1998, P 29 ANN ACM S THEOR, P176
[2]   Simple proof of fault tolerance in the graph-state model [J].
Aliferis, P ;
Leung, DW .
PHYSICAL REVIEW A, 2006, 73 (03)
[3]   Fault Tolerant Quantum Computation with Very High Threshold for Loss Errors [J].
Barrett, Sean D. ;
Stace, Thomas M. .
PHYSICAL REVIEW LETTERS, 2010, 105 (20)
[4]  
Barz S., 2013, PREPRINT
[5]   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
[6]   Experimental characterization of photonic fusion using fiber sources [J].
Bell, B. ;
Clark, A. S. ;
Tame, M. S. ;
Halder, M. ;
Fulconis, J. ;
Wadsworth, W. J. ;
Rarity, J. G. .
NEW JOURNAL OF PHYSICS, 2012, 14
[7]   Experimental characterization of universal one-way quantum computing [J].
Bell, B. A. ;
Tame, M. S. ;
Clark, A. S. ;
Nock, R. W. ;
Wadsworth, W. J. ;
Rarity, J. G. .
NEW JOURNAL OF PHYSICS, 2013, 15
[8]   Cluster-State Quantum Computing Enhanced by High-Fidelity Generalized Measurements [J].
Biggerstaff, D. N. ;
Kaltenbaek, R. ;
Hamel, D. R. ;
Weihs, G. ;
Rudolph, T. ;
Resch, K. J. .
PHYSICAL REVIEW LETTERS, 2009, 103 (24)
[9]   Measurement-based quantum computation with the toric code states [J].
Bravyi, Sergey ;
Raussendorf, Robert .
PHYSICAL REVIEW A, 2007, 76 (02)
[10]  
Briegel HJ, 2009, NAT PHYS, V5, P19, DOI [10.1038/NPHYS1157, 10.1038/nphys1157]