Fetching the paper…
Reading the bibliography…
Efficient and scalable decoding of quantum codes is essential for high-performance quantum error correction.
1904
Earlier work this paper cites.
P. Elias, “List decoding for noisy channels,” in IRE WESCON Conv. Rec
1957
Earlier work this paper cites.
R. G. Gallager, “Low-density parity-check codes,” IRE Trans. Inf. Theory
1962
Earlier work this paper cites.
J. Edmonds, “Paths, trees, and flowers,” Canadian Journal of Mathematics
1965
Earlier work this paper cites.
G. Forney, “Generalized minimum distance decoding,” IEEE Trans. Inf. Theory
1966
Earlier work this paper cites.
D. Chase, “Class of algorithms for decoding block codes with channel measurement information,” IEEE Trans. Inf. Theory
1972
Earlier work this paper cites.
J. Wolf, “Efficient maximum likelihood decoding of linear block codes using a trellis,” IEEE Trans. Inf. Theory
1978
Earlier work this paper cites.
R. Tanner, “A recursive approach to low complexity codes,” IEEE Trans. Inf. Theory
1981
Earlier work this paper cites.
J. Pearl, Probabilistic reasoning in intelligent systems: networks of plausible inference
1988
Earlier work this paper cites.
J. Snyders and Y. Be’ery, “Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes,” IEEE Trans Infor. Theory
1989
Earlier work this paper cites.
——, “Error-correcting codes for list decoding,” IEEE Trans. Inf. Theory
1991
Earlier work this paper cites.
Y. S. Han, C. R. Hartmann, and C.-C. Chen, “Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes,” IEEE Trans. Inf. Theory
1993
Earlier work this paper cites.
T. Kaneko, T. Nishijima, H. Inazumi, and S. Hirasawa, “An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder,” IEEE Trans. Inf. Theory
1994
Earlier work this paper cites.
D. J. C. MacKay and R. M. Neal, “Good codes based on very sparse matrices,” in Proc. IMA Int. Conf. Cryptogr. Coding
1995
Earlier work this paper cites.
M. P. Fossorier and S. Lin, “Soft-decision decoding of linear block codes based on ordered statistics,” IEEE Trans. Inf. Theory
1995
Earlier work this paper cites.
A. Lafourcade and A. Vardy, “Asymptotically good codes have infinite trellis complexity,” IEEE Trans. Inf. Theory
1995
Earlier work this paper cites.
A. R. Calderbank and P. W. Shor, “Good quantum error-correcting codes exist,” Phys. Rev. A
1996
Earlier work this paper cites.
A. M. Steane, “Error correcting codes in quantum theory,” Phys. Rev. Lett
1996
Earlier work this paper cites.
M. P. Fossorier and S. Lin, “Computationally efficient soft-decision decoding of linear block codes based on ordered statistics,” IEEE Trans. Inf. Theory
1996
Earlier work this paper cites.
D. Gottesman, “Stabilizer codes and quantum error correction,” Ph.D. dissertation, Caltech, 1997
1997
Earlier work this paper cites.
D. Gazelle and J. Snyders, “Reliability-based code-search algorithms for maximum-likelihood decoding of block codes,” IEEE Trans. Inf. Theory
1997
Earlier work this paper cites.
A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane, “Quantum error correction via codes over GF(4),” IEEE Trans. Inf. Theory
1998
Earlier work this paper cites.
M. P. Fossorier, S. Lin, and J. Snyders, “Reliability-based syndrome decoding of linear block codes,” IEEE Trans. Inf. Theory
1998
Earlier work this paper cites.
D. MacKay, “Good error-correcting codes based on very sparse matrices,” IEEE Trans. Inf. Theory
1999
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information
2000
Earlier work this paper cites.
F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, “Factor graphs and the sum-product algorithm,” IEEE Trans. Inf. Theory
2001
Earlier work this paper cites.
T. J. Richardson and R. L. Urbanke, “The capacity of low-density parity-check codes under message-passing decoding,” IEEE Transactions on information theory
2002
Earlier work this paper cites.
A. Y. Kitaev, “Fault-tolerant quantum computation by anyons,” Annals of Physics
2003
Earlier work this paper cites.
C. Wang, J. Harrington, and J. Preskill, “Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory,” Annals of Physics
2003
Earlier work this paper cites.
D. J. C. MacKay, G. Mitchison, and P. L. McFadden, “Sparse-graph codes for quantum error correction,” IEEE Trans. Inf. Theory
2004
Earlier work this paper cites.
S. Gounai and T. Ohtsuki, “Decoding algorithms based on oscillation for low-density parity check codes,” IEICE Trans. Fundam. Electron. Commun. Comput. Sci
2005
Earlier work this paper cites.
H. Bombin and M. A. Martin-Delgado, “Topological quantum distillation,” Phys. Rev. Lett
2006
Cited alongside, same era.
S. Gounai, T. Ohtsuki, and T. Kaneko, “Modified belief propagation decoding algorithm for low-density parity check code based on oscillation,” in IEEE Veh. Technol. Conf. (VTC)
2006
Cited alongside, same era.
H. Bombín and M. A. Martin-Delgado, “Optimal resources for topological two-dimensional stabilizer codes: Comparative study,” Phys. Rev. A
2007
Cited alongside, same era.
M. Jiang, C. Zhao, E. Xu, and L. Zhang, “Reliability-based iterative decoding of ldpc codes using likelihood accumulation,” IEEE Commun. Lett
2007
Cited alongside, same era.
D. Poulin and Y. Chung, “On the iterative decoding of sparse quantum codes,” Quantum Inf. Comput
2008
Cited alongside, same era.
K.-Y. Kuo, I.-C. Chern, and C.-Y. Lai, “Decoding of quantum data-syndrome codes via belief propagation,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT)
2021
Later among the works it cites.
C. Gidney, “Stim: a fast stabilizer circuit simulator,” Quantum
2021
Later among the works it cites.
2021
Later among the works it cites.
N. Delfosse and N. H. Nickerson, “Almost-linear time decoding algorithm for topological codes,” Quantum
2021
Later among the works it cites.
2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
T. Richardson and R. Urbanke, Modern coding theory
2008
Cited alongside, same era.
D. S. Wang, A. G. Fowler, A. M. Stephens, and L. C. L. Hollenberg, “Threshold error rates for the toric and planar codes,” Quant. Inf. Comput
2010
Cited alongside, same era.
2011
Cited alongside, same era.
A. A. Kovalev, I. Dumer, and L. P. Pryadko, “Design of additive quantum codes via the code-word-stabilized framework,” Phys. Rev. A
2011
Cited alongside, same era.
M.-H. Hsieh and F. Le Gall, “NP-hardness of decoding quantum error-correction codes,” Phys. Rev. A
2011
Cited alongside, same era.
Y.-J. Wang, B. C. Sanders, B.-M. Bai, and X.-M. Wang, “Enhanced feedback iterative decoding of sparse quantum codes,” IEEE Trans. Inf. Theory
2012
Cited alongside, same era.
C. Horsman, A. G. Fowler, S. Devitt, and R. Van Meter, “Surface code quantum computing by lattice surgery,” New J. Phys
2012
Cited alongside, same era.
L. Yang, W. Chen, and L. Chen, “Reduced complexity ordered statistics decoding of linear block codes,” in 2022 IEEE/CIC International Conference on Communications in China (ICCC Workshops)
2022
Later among the works it cites.
J. Du Crest, M. Mhalla, and V. Savin, “Stabilizer inactivation for message-passing decoding of quantum LDPC codes,” in 2022 IEEE Information Theory Workshop (ITW)
2022
Later among the works it cites.
2022
Later among the works it cites.
K.-Y. Kuo and C.-Y. Lai, “Comparison of 2D topological codes and their decoding performances,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT)
2022
Later among the works it cites.
C.-F. Kung, K.-Y. Kuo, and C.-Y. Lai, “On belief propagation decoding of quantum codes with quaternary reliability statistics,” in 2023 12th International Symposium on Topics in Coding (ISTC)
2023
Later among the works it cites.
J. Rosseel, V. Mannoni, V. Savin, and I. Fijalkow, “Sets of complementary LLRs to improve OSD post-processing of BP decoding,” in 2023 12th International Symposium on Topics in Coding (ISTC)
2023
Later among the works it cites.
J. Du Crest, F. Garcia-Herrero, M. Mhalla, V. Savin, and J. Valls, “Layered decoding of quantum ldpc codes,” in 2023 12th International Symposium on Topics in Coding (ISTC)
2023
Later among the works it cites.
A. Paler and A. G. Fowler, “Pipelined correlated minimum weight perfect matching of the surface code,” Quantum
2023
Later among the works it cites.
C.-Y. Lai and K.-Y. Kuo, “Harnessing coding theory for reliable network quantum communication,” IEEE Wireless Communications
2024
Closest in time.
D. Chytas, M. Pacenti, N. Raveendran, M. F. Flanagan, and B. Vasić, “Enhanced message-passing decoding of degenerate quantum codes utilizing trapping set dynamics,” IEEE Communications Letters
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
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
2024
Closest in time.
J. du Crest, F. Garcia-Herrero, M. Mhalla, V. Savin, and J. Valls, “Check-agnosia based post-processor for message-passing decoding of quantum LDPC codes,” Quantum
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
A. deMarti iOlius, P. Fuentes, R. Orús, P. M. Crespo, and J. E. Martinez, “Decoding algorithms for surface codes,” Quantum
2024
Closest in time.
T. Hillmann, L. Berent, A. O. Quintavalle, J. Eisert, R. Wille, and J. Roffe, “Localized statistics decoding for quantum low-density parity-check codes,” Nature Communications
2025
Closest in time.
K.-Y. Kuo and C.-Y. Lai, “Generalized quantum data-syndrome codes and belief propagation decoding for phenomenological noise,” IEEE Transactions on Information Theory
2025
Closest in time.
O. Higgott and C. Gidney, “Sparse blossom: correcting a million errors per core second with minimum-weight matching,” Quantum
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
J. Old, M. Rispler, and M. Müller, “Lift-connected surface codes,” Quantum Science and Technology
2058
Closest in time.