Fetching the paper…
Reading the bibliography…
We introduce AutDEC, a fast and accurate decoder for quantum error-correcting codes with large automorphism groups.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes , North-Holland Mathematical Library, Vol. 16 (Elsevier, 1977)
1977
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.
J. Leon, Computing automorphism groups of error-correcting codes, IEEE Transactions on Information Theory 28
1982
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.
A. R. Calderbank and P. W. Shor, Good quantum error-correcting codes exist, Physical Review A 54
1996
Earlier work this paper cites.
A. Steane, Multiple-particle interference and quantum error correction, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 452
1997
Earlier work this paper cites.
A. Calderbank, E. Rains, P. Shor, and N. Sloane, Quantum error correction via codes over GF(4), in Proceedings of IEEE International Symposium on Information Theory (1997) pp. 292–, https://ieeexplore.ieee.org/document/613213
1997
Earlier work this paper cites.
R. McEliece, D. MacKay, and J.-F. Cheng, Turbo decoding as an instance of Pearl’s “belief propagation” algorithm, IEEE Journal on Selected Areas in Communications 16
1998
Earlier work this paper cites.
G. Csardi and T. Nepusz, The igraph software package for complex network research, InterJournal, Complex Systems , 1695 (2006)
2006
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. Theor. 47
2006
Earlier work this paper cites.
T. Junttila and P. Kaski, Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs, in 2007 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) , Proceedings (Society for Industrial and Applied Mathematics, 2007) pp. 135–149
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.
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.
T. Junttila and P. Kaski, Conflict Propagation and Component Recursion for Canonical Labeling, in Theory and Practice of Algorithms in (Computer) Systems , edited by A. Marchetti-Spaccamela and M. Segal (Springer, Berlin, Heidelberg, 2011) pp. 151–162
2011
Earlier work this paper cites.
B. D. McKay and A. Piperno, Practical graph isomorphism, II, Journal of Symbolic Computation 60
2014
Earlier work this paper cites.
B. M. Terhal, Quantum error correction for quantum memories, Rev. Mod. Phys. 87
2015
Earlier work this paper cites.
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. 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.
N. P. Breuckmann and J. N. Eberhardt, Quantum Low-Density Parity-Check Codes, PRX Quantum 2
2021
Cited alongside, same era.
P. Panteleev and G. Kalachev, Degenerate Quantum LDPC Codes With Good Finite Length Performance, Quantum 5
2021
Cited alongside, same era.
E. Abbe, A. Shpilka, and M. Ye, Reed–Muller Codes: Theory and Algorithms, IEEE Transactions on Information Theory 67
2021
Cited alongside, same era.
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Geiselhart, A. Elkelesh, M. Ebada, S. Cammerer, and S. ten Brink, On the Automorphism Group of Polar Codes, in 2021 IEEE International Symposium on Information Theory (ISIT) (2021) pp. 1230–1235
2021
Cited alongside, same era.
C. Gidney, Stim: a fast stabilizer circuit simulator, Quantum 5
2021
Cited alongside, same era.
Y. Zhao, Y. Ye, H.-L. Huang, et al. , Realization of an Error-Correcting Surface Code with Superconducting Qubits, Physical Review Letters 129
2022
Cited alongside, same era.
J. Roffe, LDPC: Python tools for low density parity check codes (2022)
2022
Cited alongside, same era.
V. Bioglio, I. Land, and C. Pillet, Group Properties of Polar Codes for Automorphism Ensemble Decoding, IEEE Transactions on Information Theory 69
2023
Cited alongside, same era.
J. Mandelbaum, H. Jäkel, and L. Schmalen, Generalized Automorphisms of Channel Codes: Properties, Code Design, and a Decoder, in 2023 12th International Symposium on Topics in Coding (ISTC) (2023) pp. 1–5
2023
Cited alongside, same era.
2024
Cited alongside, same era.
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
H. Sayginel, autqec (Logical Clifford Gates from Code Automorphisms) (2024)
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
2024
Later among the works it cites.
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.
2025
Closest in time.
H. Sayginel and S. Koutsioumpas, AutDEC (2025)
2025
Closest in time.
A. Gong, gongaa/SlidingWindowDecoder (2025)
2025
Closest in time.
K. Kulkarni, pybliss (2025)
2025
Closest in time.