Degenerate Quantum LDPC Codes With Good Finite Length Performance

Projective plane and planar quantum codes

Michael H. Freedman and David A. Meyer · 2001

Earlier work this paper cites.

Topological quantum memory

Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill · 2002

Earlier work this paper cites.

Topological quantum distillation

H. Bombin and M. A. Martin-Delgado · 2006

Earlier work this paper cites.

Surface code quantum computing with error rates over 1%

David S. Wang, Austin G. Fowler, and Lloyd C. L. Hollenberg · 2011

Cited alongside, same era.

Quantum LDPC codes with positive rate and minimum distance proportional to n^1/2 . I n 2009 I E E E I n t e r n a t i o n a l S y m p o s i u m o n I n f o r m a t i o n T h e o r y , p a g e s 799 − − 803 , J u n e 2009 . 𝚍𝚘𝚒 : 10.1109 / 𝙸𝚂𝙸𝚃 ​ .2009.5205648 . [8] 8 8 S e r g e y B r a v y i a n d M a t t h e w B . H a s t i n g s . H o m o l o g i c a l p r o d u c t c o d e s . I n 𝑃𝑟𝑜𝑐𝑒𝑒𝑑𝑖𝑛𝑔𝑠𝑜𝑓𝑡ℎ𝑒𝐹𝑜𝑟𝑡𝑦 − 𝑠𝑖𝑥𝑡ℎ𝐴𝑛𝑛𝑢𝑎𝑙𝐴𝐶𝑀𝑆𝑦𝑚𝑝𝑜𝑠𝑖𝑢𝑚𝑜𝑛𝑇ℎ𝑒𝑜𝑟𝑦𝑜𝑓𝐶𝑜𝑚𝑝𝑢𝑡𝑖𝑛𝑔 , S T O C ′ 14 , p a g e s 273 − − 282 , N e w Y o r k , N Y , U S A , 2014 . A C M . 𝚍𝚘𝚒 : 10.1145 / 2591796.2591870 . [9] 9 9 A . A . K o v a l e v a n d L . P . P r y a d k o . I m p r o v e d q u a n t u m h y p e r g r a p h − p r o d u c t L D P C c o d e s . I n 2012 I E E E I n t e r n a t i o n a l S y m p o s i u m o n I n f o r m a t i o n T h e o r y P r o c e e d i n g s , p a g e s 348 − − 352 , J u l y 2012 . 𝚍𝚘𝚒 : 10.1109 / 𝙸𝚂𝙸𝚃 ​ .2012.6284206 . [10] 10 10 A l e x e y A . K o v a l e v a n d L e o n i d P . P r y a d k o . Q u a n t u m k r o n e c k e r s u m − p r o d u c t l o w − d e n s i t y p a r i t y − c h e c k c o d e s w i t h f i n i t e r a t e . 𝑃ℎ𝑦𝑠 . 𝑅𝑒𝑣 . A , 88 : 012311 , J u l 2013 . 𝚍𝚘𝚒 : 10.1103 / 𝙿𝚑𝚢𝚜𝚁𝚎𝚟𝙰 ​ .88.012311 . [11] 11 11 Z . B a b a r , P . B o t s i n i s , D . A l a n i s , S . X . N g , a n d L . H a n z o . F i f t e e n y e a r s o f q u a n t u m L D P C c o d i n g a n d i m p r o v e d d e c o d i n g s t r a t e g i e s . 𝐼𝐸𝐸𝐸𝐴𝑐𝑐𝑒𝑠𝑠 , 3 : 2492 − − 2519 , 2015 . 𝚍𝚘𝚒 : 10.1109 / 𝙰𝙲𝙲𝙴𝚂𝚂 ​ .2015.2503267 . [12] 12 12 M . H a g i w a r a a n d H . I m a i . Q u a n t u m q u a s i − c y c l i c L D P C c o d e s . I n 2007 I E E E I n t e r n a t i o n a l S y m p o s i u m o n I n f o r m a t i o n T h e o r y , p a g e s 806 − − 810 , J u n e 2007 . 𝚍𝚘𝚒 : 10.1109 / 𝙸𝚂𝙸𝚃 ​ .2007.4557323 . [13] 13 13 M . P . C . F o s s o r i e r a n d S h u L i n . S o f t − d e c i s i o n d e c o d i n g o f l i n e a r b l o c k c o d e s b a s e d o n o r d e r e d s t a t i s t i c s . 𝐼𝐸𝐸𝐸𝑇𝑟𝑎𝑛𝑠𝑎𝑐𝑡𝑖𝑜𝑛𝑠𝑜𝑛𝐼𝑛𝑓𝑜𝑟𝑚𝑎𝑡𝑖𝑜𝑛𝑇ℎ𝑒𝑜𝑟𝑦 , 41 ( 5 ) : 1379 − − 1396 , S e p .1995 . 𝚍𝚘𝚒 : 10.1109 / 18.412683 . [14] 14 14 M . P . C . F o s s o r i e r . I t e r a t i v e r e l i a b i l i t y − b a s e d d e c o d i n g o f l o w − d e n s i t y p a r i t y c h e c k c o d e s . 𝐼𝐸𝐸𝐸𝐽𝑜𝑢𝑟𝑛𝑎𝑙𝑜𝑛𝑆𝑒𝑙𝑒𝑐𝑡𝑒𝑑𝐴𝑟𝑒𝑎𝑠𝑖𝑛𝐶𝑜𝑚𝑚𝑢𝑛𝑖𝑐𝑎𝑡𝑖𝑜𝑛𝑠 , 19 ( 5 ) : 908 − − 917 , m a y 2001 . 𝚍𝚘𝚒 : 10.1109 / 49.924874 . [15] 15 15 B . D o r s c h . A d e c o d i n g a l g o r i t h m f o r b i n a r y b l o c k c o d e s a n d j − a r y o u t p u t c h a n n e l s ( c o r r e s p . ) . 𝐼𝐸𝐸𝐸𝑇𝑟𝑎𝑛𝑠𝑎𝑐𝑡𝑖𝑜𝑛𝑠𝑜𝑛𝐼𝑛𝑓𝑜𝑟𝑚𝑎𝑡𝑖𝑜𝑛𝑇ℎ𝑒𝑜𝑟𝑦 , 20 ( 3 ) : 391 − − 394 , m a y 1974 . 𝚍𝚘𝚒 : 10.1109 / 𝚃𝙸𝚃 ​ .1974.1055217 . [16] 16 16 M a t t h e w B . H a s t i n g s , J e o n g w a n H a a h , a n d R y a n O ′ D o n n e l l . F i b e r b u n d l e c o d e s : B r e a k i n g t h e n 1/2 p o l y l o g ( n ) b a r r i e r f o r q u a n t u m L D P C c o d e s . I n Proceedingsofthe53rdAnnualACMSIGACTSymposiumonTheoryofComputing , p a g e s 1276 − − 1288 . A s s o c i a t i o n f o r C o m p u t i n g M a c h i n e r y , N e w Y o r k , N Y , U S A , J u n e 2021 . 𝚍𝚘𝚒 : 10.1145 / 3406325.3451005 . [17] 17 17 P a v e l P a n t e l e e v a n d G l e b K a l a c h e v . Q u a n t u m L D P C c o d e s w i t h a l m o s t l i n e a r m i n i m u m d i s t a n c e . 𝐼𝐸𝐸𝐸𝑇𝑟𝑎𝑛𝑠𝑎𝑐𝑡𝑖𝑜𝑛𝑠𝑜𝑛𝐼𝑛𝑓𝑜𝑟𝑚𝑎𝑡𝑖𝑜𝑛𝑇ℎ𝑒𝑜𝑟𝑦 , p a g e s 1 − − 1 , 2021 . 𝚍𝚘𝚒 : 10.1109 / 𝚃𝙸𝚃 ​ .2021.3119384 . [18] 18 18 N i k o l a s P . B r e u c k m a n n a n d J e n s N . E b e r h a r d t . B a l a n c e d p r o d u c t q u a n t u m c o d e s . 𝐼𝐸𝐸𝐸𝑇𝑟𝑎𝑛𝑠𝑎𝑐𝑡𝑖𝑜𝑛𝑠𝑜𝑛𝐼𝑛𝑓𝑜𝑟𝑚𝑎𝑡𝑖𝑜𝑛𝑇ℎ𝑒𝑜𝑟𝑦 , 67 ( 10 ) : 6653 − − 6674 , O c t o b e r 2021 . 𝚍𝚘𝚒 : 10.1109 / 𝚃𝙸𝚃 ​ .2021.3097347 . [19] 19 19 M i c h a e l F r e e d m a n a n d M a t t h e w H a s t i n g s . B u i l d i n g m a n i f o l d s f r o m q u a n t u m c o d e s . 𝐺𝑒𝑜𝑚𝑒𝑡𝑟𝑖𝑐𝑎𝑛𝑑𝐹𝑢𝑛𝑐𝑡𝑖𝑜𝑛𝑎𝑙𝐴𝑛𝑎𝑙𝑦𝑠𝑖𝑠 , J u n e 2021 . 𝚍𝚘𝚒 : 10.1007 / 𝚜𝟶𝟶𝟶𝟹𝟿 − 𝟶𝟸𝟷 − 𝟶𝟶𝟻𝟼𝟽 − 𝟹 . [20] 20 20 J e o n g w a n H a a h . L o c a l s t a b i l i z e r c o d e s i n t h r e e d i m e n s i o n s w i t h o u t s t r i n g l o g i c a l o p e r a t o r s . 𝑃ℎ𝑦𝑠 . 𝑅𝑒𝑣 . A , 83 : 042330 , A p r 2011 . 𝚍𝚘𝚒 : 10.1103 / 𝙿𝚑𝚢𝚜𝚁𝚎𝚟𝙰 ​ .83.042330 . [21] 21 21 D . P o u l i n a n d Y e o j i n C . O n t h e i t e r a t i v e d e c o d i n g o f s p a r s e q u a n t u m c o d e s . 𝑄𝑢𝑎𝑛𝑡𝑢𝑚𝐼𝑛𝑓𝑜 . 𝐶𝑜𝑚𝑝𝑢𝑡 . , 8 ( 10 ) : 987 − − 1000 , N o v e m b e r 2008 . 𝚍𝚘𝚒 : 10.5555 / 2016985.2016993 . [22] 22 22 Y . W a n g , B . C . S a n d e r s , B . B a i , a n d X . W a n g . E n h a n c e d f e e d b a c k i t e r a t i v e d e c o d i n g o f s p a r s e q u a n t u m c o d e s . 𝐼𝐸𝐸𝐸𝑇𝑟𝑎𝑛𝑠𝑎𝑐𝑡𝑖𝑜𝑛𝑠𝑜𝑛𝐼𝑛𝑓𝑜𝑟𝑚𝑎𝑡𝑖𝑜𝑛𝑇ℎ𝑒𝑜𝑟𝑦 , 58 ( 2 ) : 1231 − − 1241 , F e b 2012 . 𝚍𝚘𝚒 : 10.1109 / 𝚃𝙸𝚃 ​ .2011.2169534 . [23] 23 23 A l e x R i g b y , J . C . O l i v i e r , a n d P e t e r J a r v i s . M o d i f i e d b e l i e f p r o p a g a t i o n d e c o d e r s f o r q u a n t u m l o w − d e n s i t y p a r i t y − c h e c k c o d e s . 𝑃ℎ𝑦𝑠𝑖𝑐𝑎𝑙𝑅𝑒𝑣𝑖𝑒𝑤𝐴 , 100 ( 1 ) : 012330 , J u l y 2019 . 𝚍𝚘𝚒 : 10.1103 / 𝙿𝚑𝚢𝚜𝚁𝚎𝚟𝙰 ​ .100.012330 . [24] 24 24 D a n i e l G o t t e s m a n . 𝑆𝑡𝑎𝑏𝑖𝑙𝑖𝑧𝑒𝑟𝐶𝑜𝑑𝑒𝑠𝑎𝑛𝑑𝑄𝑢𝑎𝑛𝑡𝑢𝑚𝐸𝑟𝑟𝑜𝑟𝐶𝑜𝑟𝑟𝑒𝑐𝑡𝑖𝑜𝑛 . P h D t h e s i s , C a l i f o r n i a I n s t i t u t e o f T e c h n o l o g y , 1997 . 𝚍𝚘𝚒 : 10.7907 / 𝚛𝚣𝚛𝟽 − 𝚍𝚝𝟽𝟸 . [25] 25 25 A . R . C a l d e r b a n k a n d P e t e r W . S h o r . G o o d q u a n t u m e r r o r − c o r r e c t i n g c o d e s e x i s t . 𝑃ℎ𝑦𝑠 . 𝑅𝑒𝑣 . A , 54 : 1098 − − 1105 , A u g 1996 . 𝚍𝚘𝚒 : 10.1103 / 𝙿𝚑𝚢𝚜𝚁𝚎𝚟𝙰 ​ .54.1098 . [26] 26 26 A . M . S t e a n e . E r r o r c o r r e c t i n g c o d e s i n q u a n t u m t h e o r y . 𝑃ℎ𝑦𝑠 . 𝑅𝑒𝑣 . 𝐿𝑒𝑡𝑡 . , 77 : 793 − − 797 , J u l 1996 . 𝚍𝚘𝚒 : 10.1103 / 𝙿𝚑𝚢𝚜𝚁𝚎𝚟𝙻𝚎𝚝𝚝 ​ .77.793 . [27] 27 27 R . G . G a l l a g e r . 𝐿𝑜𝑤 − 𝐷𝑒𝑛𝑠𝑖𝑡𝑦𝑃𝑎𝑟𝑖𝑡𝑦 − 𝐶ℎ𝑒𝑐𝑘𝐶𝑜𝑑𝑒𝑠 . M . I . T . P r e s s , C a m b r i d g e , M A , 1963 . 𝚍𝚘𝚒 : 10.7551 / 𝚖𝚒𝚝𝚙𝚛𝚎𝚜𝚜 / 4347.001.0001 . [28] 28 28 R . T a n n e r . A r e c u r s i v e a p p r o a c h t o l o w c o m p l e x i t y c o d e s . 𝐼𝐸𝐸𝐸𝑇𝑟𝑎𝑛𝑠𝑎𝑐𝑡𝑖𝑜𝑛𝑠𝑜𝑛𝐼𝑛𝑓𝑜𝑟𝑚𝑎𝑡𝑖𝑜𝑛𝑇ℎ𝑒𝑜𝑟𝑦 , 27 ( 5 ) : 533 − − 547 , S e p t e m b e r 1981 . 𝚍𝚘𝚒 : 10.1109 / 𝚃𝙸𝚃 ​ .1981.1056404 . [29] 29 29 F . R . K s c h i s c h a n g , B . J . F r e y , a n d H . − A . L o e l i g e r . F a c t o r g r a p h s a n d t h e s u m − p r o d u c t a l g o r i t h m . 𝐼𝐸𝐸𝐸𝑇𝑟𝑎𝑛𝑠𝑎𝑐𝑡𝑖𝑜𝑛𝑠𝑜𝑛𝐼𝑛𝑓𝑜𝑟𝑚𝑎𝑡𝑖𝑜𝑛𝑇ℎ𝑒𝑜𝑟𝑦 , 47 ( 2 ) : 498 − − 519 , F e b r u a r y 2001 . 𝚍𝚘𝚒 : 10.1109 / 18.910572 . [30] 30 30 E . P r a n g e . T h e u s e o f i n f o r m a t i o n s e t s i n d e c o d i n g c y c l i c c o d e s . 𝐼𝑅𝐸𝑇𝑟𝑎𝑛𝑠𝑎𝑐𝑡𝑖𝑜𝑛𝑠𝑜𝑛𝐼𝑛𝑓𝑜𝑟𝑚𝑎𝑡𝑖𝑜𝑛𝑇ℎ𝑒𝑜𝑟𝑦 , 8 ( 5 ) : 5 − − 9 , S e p t e m b e r 1962 . 𝚍𝚘𝚒 : 10.1109 / 𝚃𝙸𝚃 ​ .1962.1057777 . [31] 31 31 J a c k E d m o n d s . M a t r o i d s a n d t h e g r e e d y a l g o r i t h m . 𝑀𝑎𝑡ℎ𝑒𝑚𝑎𝑡𝑖𝑐𝑎𝑙𝑃𝑟𝑜𝑔𝑟𝑎𝑚𝑚𝑖𝑛𝑔 , 1 ( 1 ) : 127 − − 136 , D e c e m b e r 1971 . 𝚍𝚘𝚒 : 10.1007 / 𝙱𝙵𝟶𝟷𝟻𝟾𝟺𝟶𝟾𝟸 . [32] 32 32 M . P . C . F o s s o r i e r , S h u L i n , a n d J . S n y d e r s . R e l i a b i l i t y − b a s e d s y n d r o m e d e c o d i n g o f l i n e a r b l o c k c o d e s . 𝐼𝐸𝐸𝐸𝑇𝑟𝑎𝑛𝑠𝑎𝑐𝑡𝑖𝑜𝑛𝑠𝑜𝑛𝐼𝑛𝑓𝑜𝑟𝑚𝑎𝑡𝑖𝑜𝑛𝑇ℎ𝑒𝑜𝑟𝑦 , 44 ( 1 ) : 388 − − 398 , J a n u a r y 1998 . 𝚍𝚘𝚒 : 10.1109 / 18.651070 . [33] 33 33 R a y m o n d L a f l a m m e , C e s a r M i q u e l , J u a n P a b l o P a z , a n d W o j c i e c h H u b e r t Z u r e k . P e r f e c t q u a n t u m e r r o r c o r r e c t i n g c o d e . 𝑃ℎ𝑦𝑠𝑖𝑐𝑎𝑙𝑅𝑒𝑣𝑖𝑒𝑤𝐿𝑒𝑡𝑡𝑒𝑟𝑠 , 77 ( 1 ) : 198 − − 201 , J u l y 1996 . 𝚍𝚘𝚒 : 10.1103 / 𝙿𝚑𝚢𝚜𝚁𝚎𝚟𝙻𝚎𝚝𝚝 ​ .77.198 . [34] 34 34 K a o − Y u e h K u o a n d C h i n g − Y i L a i . R e f i n e d b e l i e f p r o p a g a t i o n d e c o d i n g o f s p a r s e − g r a p h q u a n t u m c o d e s . 𝐼𝐸𝐸𝐸𝐽𝑜𝑢𝑟𝑛𝑎𝑙𝑜𝑛𝑆𝑒𝑙𝑒𝑐𝑡𝑒𝑑𝐴𝑟𝑒𝑎𝑠𝑖𝑛𝐼𝑛𝑓𝑜𝑟𝑚𝑎𝑡𝑖𝑜𝑛𝑇ℎ𝑒𝑜𝑟𝑦 , 1 ( 2 ) : 487 − − 498 , A u g u s t 2020 . 𝚍𝚘𝚒 : 10.1109 / 𝙹𝚂𝙰𝙸𝚃 ​ .2020.3011758 . [35] 35 35 M a r c F o s s o r i e r , D a v i d D e c l e r c q , a n d E z i o B i g l i e r i . 𝐶ℎ𝑎𝑛𝑛𝑒𝑙𝐶𝑜𝑑𝑖𝑛𝑔 : 𝑇ℎ𝑒𝑜𝑟𝑦 , 𝐴𝑙𝑔𝑜𝑟𝑖𝑡ℎ𝑚𝑠 , 𝑎𝑛𝑑𝐴𝑝𝑝𝑙𝑖𝑐𝑎𝑡𝑖𝑜𝑛𝑠 . A c a d e m i c P r e s s , J u l y 2014 . 𝚍𝚘𝚒 : 10.1016 / 𝙲𝟸𝟶𝟷𝟷 − 𝟶 − 𝟶𝟽𝟸𝟷𝟷 − 𝟹 . [36] 36 36 J a c k E d m o n d s . P a t h s , T r e e s , a n d F l o w e r s . 𝐶𝑎𝑛𝑎𝑑𝑖𝑎𝑛𝐽𝑜𝑢𝑟𝑛𝑎𝑙𝑜𝑓𝑀𝑎𝑡ℎ𝑒𝑚𝑎𝑡𝑖𝑐𝑠 , 17 : 449 − − 467 , 1965 / e d . 𝚍𝚘𝚒 : 10.4153 / 𝙲𝙹𝙼 − 𝟷𝟿𝟼𝟻 − 𝟶𝟺𝟻 − 𝟺 . [37] 37 37 D . J . C . M a c K a y , G . M i t c h i s o n , a n d P . L . M c F a d d e n . S p a r s e − g r a p h c o d e s f o r q u a n t u m e r r o r c o r r e c t i o n . 𝐼𝐸𝐸𝐸𝑇𝑟𝑎𝑛𝑠𝑎𝑐𝑡𝑖𝑜𝑛𝑠𝑜𝑛𝐼𝑛𝑓𝑜𝑟𝑚𝑎𝑡𝑖𝑜𝑛𝑇ℎ𝑒𝑜𝑟𝑦 , 50 ( 10 ) : 2315 − − 2330 , O c t 2004 . 𝚍𝚘𝚒 : 10.1109 / 𝚃𝙸𝚃 ​ .2004.834737 . [38] 38 38 H B o m b i n , R W C h h a j l a n y , M H o r o d e c k i , a n d M A M a r t i n − D e l g a d o . S e l f − c o r r e c t i n g q u a n t u m c o m p u t e r s . 𝑁𝑒𝑤𝐽𝑜𝑢𝑟𝑛𝑎𝑙𝑜𝑓𝑃ℎ𝑦𝑠𝑖𝑐𝑠 , 15 ( 5 ) : 055023 , m a y 2013 . 𝚍𝚘𝚒 : 10.1088 / 𝟷𝟹𝟼𝟽 − 𝟸𝟼𝟹𝟶 / 𝟷𝟻 / 𝟻 / 𝟶𝟻𝟻𝟶𝟸𝟹 . [39] 39 39 Y u i c h i r o F u j i w a r a . A b i l i t y o f s t a b i l i z e r q u a n t u m e r r o r c o r r e c t i o n t o p r o t e c t i t s e l f f r o m i t s o w n i m p e r f e c t i o n . 𝑃ℎ𝑦𝑠 . 𝑅𝑒𝑣 . A , 90 : 062304 , D e c 2014 . 𝚍𝚘𝚒 : 10.1103 / 𝙿𝚑𝚢𝚜𝚁𝚎𝚟𝙰 ​ .90.062304 . [40] 40 40 T o m R i c h a r d s o n . E r r o r − f l o o r s o f L D P C c o d e s . I n Proceedingsofthe41stAnnualConferenceonCommunication , 𝐶𝑜𝑛𝑡𝑟𝑜𝑙𝑎𝑛𝑑𝐶𝑜𝑚𝑝𝑢𝑡𝑖𝑛𝑔 , p a g e s 1426 − − 1435 , 2003 . [41] 41 41 Y e − H u a L i u a n d D a v i d P o u l i n . N e u r a l b e l i e f − p r o p a g a t i o n d e c o d e r s f o r q u a n t u m e r r o r − c o r r e c t i n g c o d e s . 𝑃ℎ𝑦𝑠𝑖𝑐𝑎𝑙𝑅𝑒𝑣𝑖𝑒𝑤𝐿𝑒𝑡𝑡𝑒𝑟𝑠 , 122 ( 20 ) : 200501 , M a y 2019 . 𝚍𝚘𝚒 : 10.1103 / 𝙿𝚑𝚢𝚜𝚁𝚎𝚟𝙻𝚎𝚝𝚝 ​ .122.200501 . [42] 42 42 K r i s t i n e L a l l y a n d P a t r i c k F i t z p a t r i c k . A l g e b r a i c s t r u c t u r e o f q u a s i c y c l i c c o d e s . 𝐷𝑖𝑠𝑐𝑟𝑒𝑡𝑒𝐴𝑝𝑝𝑙𝑖𝑒𝑑𝑀𝑎𝑡ℎ𝑒𝑚𝑎𝑡𝑖𝑐𝑠 , 111 ( 1 ) : 157 − − 175 , J u l y 2001 . 𝚍𝚘𝚒 : 10.1016 / 𝚂𝟶𝟷𝟼𝟼 − 𝟸𝟷𝟾 ​ 𝚇 ​ ( 𝟶𝟶 ) ​ 𝟶𝟶𝟹𝟻𝟶 − 𝟺 . [43] 43 43 R o x a n a S m a r a n d a c h e a n d P a s c a l O . V o n t o b e l . Q u a s i − c y c l i c L D P C c o d e s : I n f l u e n c e o f p r o t o − a n d t a n n e r − g r a p h s t r u c t u r e o n m i n i m u m h a m m i n g d i s t a n c e u p p e r b o u n d s . 𝐼𝐸𝐸𝐸𝑇𝑟𝑎𝑛𝑠𝑎𝑐𝑡𝑖𝑜𝑛𝑠𝑜𝑛𝐼𝑛𝑓𝑜𝑟𝑚𝑎𝑡𝑖𝑜𝑛𝑇ℎ𝑒𝑜𝑟𝑦 , 58 ( 2 ) : 585 − − 607 , F e b r u a r y 2012 . 𝚍𝚘𝚒 : 10.1109 / 𝚃𝙸𝚃 ​ .2011.2173244 . [44] 44 44 S a n L i n g , H a r a l d N i e d e r r e i t e r , a n d P a t r i c k S o l é . O n t h e a l g e b r a i c s t r u c t u r e o f q u a s i − c y c l i c c o d e s I V : R e p e a t e d r o o t s . 𝐷𝑒𝑠𝑖𝑔𝑛𝑠 , 𝐶𝑜𝑑𝑒𝑠𝑎𝑛𝑑𝐶𝑟𝑦𝑝𝑡𝑜𝑔𝑟𝑎𝑝ℎ𝑦 , 38 : 337 − − 361 , 2006 . 𝚍𝚘𝚒 : 10.1007 / 𝚜𝟷𝟶𝟼𝟸𝟹 − 𝟶𝟶𝟻 − 𝟷𝟺𝟹𝟷 − 𝟽 . [45] 45 45 I . D u m e r , A . A . K o v a l e v , a n d L . P . P r y a d k o . D i s t a n c e v e r i f i c a t i o n f o r c l a s s i c a l a n d q u a n t u m L D P C c o d e s . 𝐼𝐸𝐸𝐸𝑇𝑟𝑎𝑛𝑠𝑎𝑐𝑡𝑖𝑜𝑛𝑠𝑜𝑛𝐼𝑛𝑓𝑜𝑟𝑚𝑎𝑡𝑖𝑜𝑛𝑇ℎ𝑒𝑜𝑟𝑦 , 63 ( 7 ) : 4675 − − 4686 , 2017 . 𝚍𝚘𝚒 : 10.1109 / 𝚃𝙸𝚃 ​ .2017.2690381

J. Tillich and G. Zémor · 2013

Cited alongside, same era.

Efficient algorithms for maximum likelihood decoding in the surface code

Sergey Bravyi, Martin Suchara, and Alexander Vargo · 2014

Later among the works it cites.

Constructions and noise threshold of hyperbolic surface codes

Nikolas P. Breuckmann and Barbara M. Terhal · 2016

Later among the works it cites.