Neural ensemble decoding for topological quantum error-correcting codes

被引:17
作者
Sheth, Milap [1 ,2 ,3 ]
Jafarzadeh, Sara Zafar [1 ,4 ]
Gheorghiu, Vlad [1 ,2 ,5 ]
机构
[1] Univ Waterloo, Inst Quantum Comp, Waterloo, ON N2L 3G1, Canada
[2] Univ Waterloo, Dept Combinator & Optimizat, Waterloo, ON N2L 3G1, Canada
[3] Univ Waterloo, David R Cheriton Sch Comp Sci, Waterloo, ON N2L 3G1, Canada
[4] Univ Montreal, Dept Comp Sci & Operat Res, Montreal, PQ H3T 1J4, Canada
[5] SoftwareQ Inc, Kitchener, ON N2M 0A9, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
39;
D O I
10.1103/PhysRevA.101.032338
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
Topological quantum error-correcting codes are a promising candidate for building fault-tolerant quantum computers. Decoding topological codes optimally, however, is known to be a computationally hard problem. Various decoders have been proposed that achieve approximately optimal error thresholds. Due to practical constraints, it is not known if there exists an obvious choice for a decoder. In this paper, we introduce a framework which can combine arbitrary decoders for any given code to significantly reduce the logical error rates. We rely on the crucial observation that two different decoding techniques, while possibly having similar logical error rates, can perform differently on the same error syndrome. We classify each error syndrome to the decoder which is more likely to decode it correctly using machine learning techniques. We apply our framework to an ensemble of minimum-weight perfect matching (MWPM) and hard-decision re-normalization-group decoders for the surface code in the depolarizing noise model. Our simulations show an improvement of 38.4%, 14.6%, and 7.1% over the pseudothreshold of MWPM in the instance of distance 5, 7, and 9 codes, respectively. Lastly, we discuss the advantages and limitations of our framework and applicability to other error-correcting codes. Our framework can provide a significant boost to error correction by combining the strengths of various decoders. In particular, it may allow for combining very fast decoders with moderate error-correcting capability to create a very fast ensemble decoder with high error-correcting capability.
引用
收藏
页数:8
相关论文
共 38 条
[11]  
Chollet F., KERAS
[12]   Photophysics of fullerenes: Thermionic emission [J].
Compton, RN ;
Tuinman, AA ;
Huang, J .
RESONANCE IONIZATION SPECTROSCOPY 1996 - EIGHTH INTERNATIONAL SYMPOSIUM, 1997, (388) :21-26
[13]   Linear-time general decoding algorithm for the surface code [J].
Darmawan, Andrew S. ;
Poulin, David .
PHYSICAL REVIEW E, 2018, 97 (05)
[14]  
Delfosse N., ARXIV170906218QUANTP
[15]   Topological quantum memory [J].
Dennis, E ;
Kitaev, A ;
Landahl, A ;
Preskill, J .
JOURNAL OF MATHEMATICAL PHYSICS, 2002, 43 (09) :4452-4505
[16]   Fast Decoders for Topological Quantum Codes [J].
Duclos-Cianci, Guillaume ;
Poulin, David .
PHYSICAL REVIEW LETTERS, 2010, 104 (05)
[17]   PATHS TREES AND FLOWERS [J].
EDMONDS, J .
CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (03) :449-&
[18]   Surface codes: Towards practical large-scale quantum computation [J].
Fowler, Austin G. ;
Mariantoni, Matteo ;
Martinis, John M. ;
Cleland, Andrew N. .
PHYSICAL REVIEW A, 2012, 86 (03)
[19]  
Goodfellow I., 2016, DEEP LEARNING
[20]   Quantum mechanics helps in searching for a needle in a haystack [J].
Grover, LK .
PHYSICAL REVIEW LETTERS, 1997, 79 (02) :325-328