Fetching the paper…
Reading the bibliography…
Two-dimensional quantum colour codes hold significant promise for quantum error correction, offering advantages such as planar connectivity and low overhead logical gates.
R. Tanner, A recursive approach to low complexity codes (1981)
1981
Earlier work this paper cites.
J. Pearl, Reverend Bayes on inference engines: a distributed hierarchical approach, in Proceedings of the Second AAAI Conference on Artificial Intelligence , AAAI’82 (AAAI Press, Pittsburgh, Pennsylvania, 1982) pp. 133–136
1982
Earlier work this paper cites.
C. H. Bennett and S. J. Wiesner, Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states, Physical Review Letters 69
1992
Earlier work this paper cites.
P. W. Shor, Scheme for reducing decoherence in quantum computer memory, Phys. Rev. A 52
1995
Earlier work this paper cites.
M. Fossorier and S. Lin, Soft-decision decoding of linear block codes based on ordered statistics, IEEE Transactions on Information Theory 41
1995
Earlier work this paper cites.
A. M. Steane, Error correcting codes in quantum theory, Phys. Rev. Lett. 77
1996
Earlier work this paper cites.
D. J. C. MacKay and R. M. Neal, Near Shannon limit performance of low density parity check codes, Electronics Letters 32
1996
Earlier work this paper cites.
D. Gottesman, Stabilizer Codes and Quantum Error Correction (1997), arXiv:quant-ph/9705052
1997
Earlier work this paper cites.
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, Topological quantum memory, Journal of Mathematical Physics 43
2002
Earlier work this paper cites.
T. Richardson, Error floors of LDPC codes, in Proc. Allerton Conference on Communications, Control, and Computing, Monticello, Oct. 2003 (2003) pp. 1426–1435
2003
Earlier work this paper cites.
S. Aaronson and D. Gottesman, Improved Simulation of Stabilizer Circuits, Physical Review A 70
2004
Earlier work this paper cites.
J. Zhang, Y. Wang, M. Fossorier, and J. Yedidia, Replica shuffled iterative decoding, in Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. (2005) pp. 454–458, iSSN: 2157-8117
2005
Earlier work this paper cites.
J. Zhang and M. Fossorier, Shuffled iterative decoding, IEEE Transactions on Communications 53
2005
Earlier work this paper cites.
A. Darabiha, A. Carusone, and F. Kschischang, A bit-serial approximate min-sum LDPC decoder and FPGA implementation, in 2006 IEEE International Symposium on Circuits and Systems (2006) pp. 4 pp.–
2006
Earlier work this paper cites.
H. Bombin and M. A. Martin-Delgado, Topological Quantum Distillation, Physical Review Letters 97
2006
Earlier work this paper cites.
G. Masera, F. Quaglio, and F. Vacca, Implementation of a flexible LDPC decoder, IEEE Transactions on Circuits and Systems II: Express Briefs 54
2007
Earlier work this paper cites.
J. Goldberger and H. Kfir, Serial Schedules for Belief-Propagation: Analysis of Convergence Time, IEEE Transactions on Information Theory 54
2008
Earlier work this paper cites.
D. Poulin and Y. Chung, On the iterative decoding of sparse quantum codes, Quantum Info. Comput. 8
2008
Earlier work this paper cites.
N. Hussami, S. B. Korada, and R. Urbanke, Performance of polar codes for channel and source coding, in 2009 IEEE International Symposium on Information Theory (2009) pp. 1488–1492
2009
Earlier work this paper cites.
M. Bastian, S. Heymann, and M. Jacomy, Gephi: An Open Source Software for Exploring and Manipulating Networks, Proceedings of the International AAAI Conference on Web and Social Media 3
2009
Earlier work this paper cites.
G. Duclos-Cianci and D. Poulin, A renormalization group decoding algorithm for topological quantum codes, in 2010 IEEE Information Theory Workshop (2010) pp. 1–5
2010
Earlier work this paper cites.
D. S. Wang, A. G. Fowler, C. D. Hill, and L. C. L. Hollenberg, Graphical algorithms and threshold error rates for the 2d color code, Quantum Info. Comput. 10
2010
Earlier work this paper cites.
A. G. Fowler, Two-dimensional color-code quantum computation, Physical Review A 83
2011
Earlier work this paper cites.
2011
Earlier work this paper cites.
A. G. Fowler, Surface codes: Towards practical large-scale quantum computation, Physical Review A 86
2012
Earlier work this paper cites.
P. Sarvepalli and R. Raussendorf, Efficient decoding of topological color codes, Physical Review A 85
2012
Earlier work this paper cites.
H. Bombin, An introduction to topological quantum codes (2013), arXiv:1311.0277 [quant-ph]
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
N. Delfosse, Decoding color codes by projection onto surface codes, Physical Review A 89
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
B. M. Terhal, Quantum error correction for quantum memories, Rev. Mod. Phys. 87
2015
Cited alongside, same era.
G. Tzimpragos, C. Kachris, I. B. Djordjevic, M. Cvijetic, D. Soudris, and I. Tomkos, A survey on fec codes for 100 g and beyond optical networks, IEEE Communications Surveys & Tutorials 18
2016
Cited alongside, same era.
P. Hailes, Design and implementation of flexible FPGA-based LDPC decoders , Ph.D. thesis , University of Southampton (2018)
2018
Cited alongside, same era.
P. Baireuther, M. D. Caio, B. Criger, C. W. J. Beenakker, and T. E. O’Brien, Neural network decoder for topological color codes with circuit level noise, New Journal of Physics 21
2019
Cited alongside, same era.
D. Litinski, A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery, Quantum 3
2019
Cited alongside, same era.
O. Higgott, Practical and Efficient Quantum Error Correction , Ph.D. thesis , UCL (University College London) (2024)
2024
Later among the works it cites.
L. Berent, L. Burgholzer, P.-J. H. S. Derks, J. Eisert, and R. Wille, Decoding quantum color codes with MaxSAT, Quantum 8
2024
Later among the works it cites.
J. Mandelbaum, S. Miao, H. Jakel, and L. Schmalen, Endomorphisms of linear block codes, in 2024 IEEE International Symposium on Information Theory (ISIT) (2024) pp. 699–704
2024
Later among the works it cites.
2024
Later among the works it cites.
S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, and T. J. Yoder, High-threshold and low-overhead fault-tolerant quantum memory, Nature 627
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Shao, P. Hailes, T.-Y. Wang, J.-Y. Wu, R. G. Maunder, B. M. Al-Hashimi, and L. Hanzo, Survey of turbo, LDPC, and polar decoder asic implementations, IEEE Communications Surveys & Tutorials 21
2019
Cited alongside, same era.
J. Roffe, D. R. White, S. Burton, and E. Campbell, Decoding across the quantum low-density parity-check code landscape, Physical Review Research 2
2020
Cited alongside, same era.
M. Geiselhart, A. Elkelesh, M. Ebada, S. Cammerer, and S. ten Brink, CRC-Aided Belief Propagation List Decoding of Polar Codes, in 2020 IEEE International Symposium on Information Theory (ISIT) (2020) pp. 395–400, iSSN: 2157-8117
2020
Cited alongside, same era.
M. Sheth, S. Z. Jafarzadeh, and V. Gheorghiu, Neural ensemble decoding for topological quantum error-correcting codes, Physical Review A 101
2020
Cited alongside, same era.
K.-Y. Kuo and C.-Y. Lai, Refined Belief Propagation Decoding of Sparse-Graph Quantum Codes, IEEE Journal on Selected Areas in Information Theory 1
2020
Cited alongside, same era.
C. Gidney, M. Newman, A. Fowler, and M. Broughton, A Fault-Tolerant Honeycomb Memory, Quantum 5
2021
Cited alongside, same era.
N. Delfosse and N. H. Nickerson, Almost-linear time decoding algorithm for topological codes, Quantum 5
2021
Cited alongside, same era.
2024
Later among the works it cites.
2024
Later among the works it cites.
S.-H. Lee, color-code-stim (2025), original-date: 2024-03-24T22:51:55Z
2024
Later among the works it cites.
2025
Closest in time.
N. Lacroix et al. , Scaling and logic in the colour code on a superconducting quantum processor, Nature , 1 (2025) , publisher: Nature Publishing Group
2025
Closest in time.
I. Pogorelov, F. Butt, L. Postler, C. D. Marciniak, P. Schindler, M. Müller, and T. Monz, Experimental fault-tolerant code switching, Nature Physics 21
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
O. Higgott and C. Gidney, Sparse Blossom: correcting a million errors per core second with minimum-weight matching, Quantum 9
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
A. Eickbusch et al. , Demonstrating dynamic surface codes (2025), arXiv:2412.14360 [quant-ph]
2025
Closest in time.
C. Gidney, M. Newman, P. Brooks, and C. Jones, Yoked surface codes, Nature Communications 16
2025
Closest in time.
K. Sahay, Y. Lin, S. Huang, K. R. Brown, and S. Puri, Error correction of transversal CNOT gates for scalable surface-code computation, PRX Quantum 6
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
B. M. Varbanov, M. Serra-Peralta, D. Byfield, and B. M. Terhal, Neural network decoder for near-term surface-code experiments, Physical Review Research 7
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
F. Krieg, J. Clausius, M. Rübenacke, and S. t. Brink, A Comparative Study of Ensemble Decoding Methods for Short Length LDPC Codes, in 2025 14th International ITG Conference on Systems, Communications and Coding (SCC) (2025) pp. 1–6
2025
Closest in time.
Y. Shen, Z. Li, Y. Ren, E. Boutillon, A. Balatsoukas-Stimming, C. Zhang, X. You, and A. Burg, Toward Universal Belief Propagation Decoding for Short Binary Block Codes, IEEE Journal on Selected Areas in Communications 43
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.