Fetching the paper…
Reading the bibliography…
Fast and accurate quantum error correction (QEC) decoding is crucial for scalable fault-tolerant quantum computation.
G. B. Dantzig, “Maximization of a linear function of variables subject to linear inequalities,” Activity analysis of production and allocation , 1951
1951
Earlier work this paper cites.
J. Edmonds, “Paths, trees, and flowers,” Canadian Journal of mathematics , 1965
1965
Earlier work this paper cites.
L. Lovász, “The factorization of graphs. II,” Acta Mathematica Academiae Scientiarum Hungarica , 1972
1972
Earlier work this paper cites.
J. Edmonds and E. L. Johnson, “Matching, Euler tours and the Chinese postman,” Mathematical programming , 1973
1973
Earlier work this paper cites.
E. Berlekamp, R. McEliece, and H. Van Tilborg, “On the inherent intractability of certain coding problems,” IEEE Transactions on Information Theory , 1978
1978
Earlier work this paper cites.
L. J. Stockmeyer and V. V. Vazirani, “Np-completeness of some generalizations of the maximum matching problem,” Information Processing Letters , 1982
1982
Earlier work this paper cites.
N. Karmarkar, “A new polynomial-time algorithm for linear programming,” in Proceedings of the sixteenth annual ACM symposium on Theory of computing , 1984
1984
Earlier work this paper cites.
S. J. Leon, L. De Pillis, and L. G. De Pillis, Linear algebra with applications . Prentice Hall Upper Saddle River, NJ, 1998
1998
Earlier work this paper cites.
M. P. Fossorier, S. Lin, and J. Snyders, “Reliability-based syndrome decoding of linear block codes,” IEEE Transactions on Information Theory , 1998
1998
Earlier work this paper cites.
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, “Topological quantum memory,” Journal of Mathematical Physics , 2002
2002
Earlier work this paper cites.
M. P. Fossorier and S. Lin, “Soft-decision decoding of linear block codes based on ordered statistics,” IEEE Transactions on information Theory , 2002
2002
Earlier work this paper cites.
W. L. Winston, Operations research: applications and algorithm . Thomson Learning, Inc., 2004
2004
Earlier work this paper cites.
A. Farrugia, P. Mihók, R. B. Richter, and G. Semanivšin, “Factorizations and characterizations of induced-hereditary and compositive properties,” Journal of Graph Theory , 2005
2005
Earlier work this paper cites.
J. Feldman, M. J. Wainwright, and D. R. Karger, “Using linear programming to decode binary linear codes,” IEEE Transactions on Information Theory , 2005
2005
Earlier work this paper cites.
H. Bombin and M. A. Martin-Delgado, “Topological quantum distillation,” Physical review letters , 2006
2006
Earlier work this paper cites.
J. Emerson, M. Silva, O. Moussa, C. Ryan, M. Laforest, J. Baugh, D. G. Cory, and R. Laflamme, “Symmetrized characterization of noisy quantum processes,” Science , 2007
2007
Earlier work this paper cites.
J. Matoušek and B. Gärtner, Understanding and using linear programming . Springer, 2007
2007
Earlier work this paper cites.
2008
Earlier work this paper cites.
V. Kolmogorov, “Blossom v: a new implementation of a minimum cost perfect matching algorithm,” Mathematical Programming Computation , 2009
2009
Earlier work this paper cites.
Q. R. Yu and G. Liu, Graph factors and matching extensions . Springer, 2010
2010
Earlier work this paper cites.
J. Akiyama and M. Kano, Factors and factorizations of graphs: Proof techniques in factor theory . Springer, 2011
2011
Earlier work this paper cites.
2011
Earlier work this paper cites.
A. G. Fowler, A. C. Whiteside, and L. C. Hollenberg, “Towards practical classical processing for the surface code,” Physical review letters , 2012
2012
Earlier work this paper cites.
2013
Earlier work this paper cites.
S. Barman, X. Liu, S. C. Draper, and B. Recht, “Decomposition methods for large scale lp decoding,” IEEE Transactions on Information Theory , 2013
2013
Earlier work this paper cites.
S. Varsamopoulos, B. Criger, and K. Bertels, “Decoding small surface codes with feedforward neural networks,” Quantum Science and Technology , 2017
2017
Earlier work this paper cites.
Q. Huangfu and J. J. Hall, “Parallelizing the dual revised simplex method,” Mathematical Programming Computation , 2018
2018
Earlier work this paper cites.
J. X. Li and P. O. Vontobel, “Lp decoding of quantum stabilizer codes,” in IEEE International Symposium on Information Theory (ISIT) , 2018
2018
Earlier work this paper cites.
D. K. Tuckett, A. S. Darmawan, C. T. Chubb, S. Bravyi, S. D. Bartlett, and S. T. Flammia, “Tailoring surface codes for highly biased noise,” Physical Review X , 2019
2019
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 , 2020
2020
Cited alongside, same era.
S. Huang, M. Newman, and K. R. Brown, “Fault-tolerant weighted union-find decoding on the toric code,” Physical Review A , 2020
2020
Cited alongside, same era.
P. Kumar, “SLP,” 2020. [Online]. Available: https://crates.io/crates/slp
2020
Cited alongside, same era.
D. Ristè, L. C. Govia, B. Donovan, S. D. Fallek, W. D. Kalfus, M. Brink, N. T. Bronn, and T. A. Ohki, “Real-time processing of stabilizer measurements in a bit-flip code,” npj Quantum Information , 2020
2020
Cited alongside, same era.
L. Henriet, L. Beguin, A. Signoles, T. Lahaye, A. Browaeys, G.-O. Reymond, and C. Jurczak, “Quantum computing with neutral atoms,” Quantum , 2020
2020
2023
Later among the works it cites.
2024
Later among the works it cites.
L. Berent, L. Burgholzer, P.-J. H. Derks, J. Eisert, and R. Wille, “Decoding quantum color codes with maxsat,” Quantum , 2024
2024
Later among the works it cites.
A. deMarti iOlius, P. Fuentes, R. Orús, P. M. Crespo, and J. E. Martinez, “Decoding algorithms for surface codes,” 2024
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…
Cited alongside, same era.
N. Delfosse and N. H. Nickerson, “Almost-linear time decoding algorithm for topological codes,” Quantum , 2021
2021
Cited alongside, same era.
O. Fawzi, L. Grouès, and A. Leverrier, “Linear programming decoder for hypergraph product quantum codes,” in IEEE Information Theory Workshop (ITW) , 2021
2021
Cited alongside, same era.
C. Gidney, “Stim: a fast stabilizer circuit simulator,” Quantum , 2021
2021
Cited alongside, same era.
G. Q. AI, “Exponential suppression of bit or phase errors with cyclic error correction,” Nature , 2021
2021
Cited alongside, same era.
L. Egan, D. M. Debroy, C. Noel, A. Risinger, D. Zhu, D. Biswas, M. Newman, M. Li, K. R. Brown, M. Cetina et al. , “Fault-tolerant control of an error-corrected qubit,” Nature , 2021
2021
Cited alongside, same era.
C. Ryan-Anderson, J. G. Bohnet, K. Lee, D. Gresh, A. Hankin, J. Gaebler, D. Francois, A. Chernoguzov, D. Lucchetti, N. C. Brown et al. , “Realization of real-time fault-tolerant quantum error correction,” Physical Review X , 2021
2021
Cited alongside, same era.
P. Panteleev and G. Kalachev, “Degenerate quantum LDPC codes with good finite length performance,” Quantum , 2021
2021
Cited alongside, same era.
2024
Later among the works it cites.
2024
Later among the works it cites.
P.-K. Tsai, Y. Wu, and S. Puri, “Mitigating temporal fragility in the xy surface code,” Physical Review X , 2024
2024
Later among the works it cites.
2024
Later among the works it cites.
N. Liyanage, Y. Wu, S. Tagare, and L. Zhong, “FPGA-based distributed union-find decoder for surface codes,” IEEE Transactions on Quantum Engineering , 2024
2024
Later among the works it cites.
D. Bluvstein, S. J. Evered, A. A. Geim, S. H. Li, H. Zhou, T. Manovitz, S. Ebadi, M. Cain, M. Kalinowski, D. Hangleiter et al. , “Logical quantum processor based on reconfigurable atom arrays,” Nature , 2024
2024
Later among the works it cites.
M. Cain, C. Zhao, H. Zhou, N. Meister, J. P. B. Ataides, A. Jaffe, D. Bluvstein, and M. D. Lukin, “Correlated decoding of logical algorithms with transversal gates,” Physical Review Letters , 2024
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
A. Gong, S. Cammerer, and J. M. Renes, “Graph neural networks for enhanced decoding of quantum LDPC codes,” in IEEE International Symposium on Information Theory (ISIT) , 2024
2024
Later among the works it cites.
L. Yang, Y. Wu, and L. Zhong, “Parallel minimum-weight parity factor decoding for quantum error correction,” in Proc. IEEE Int. Conf. Quantum Computing & Engineering (QCE) , 2024
2024
Later among the works it cites.
O. Higgott and C. Gidney, “Sparse blossom: correcting a million errors per core second with minimum-weight matching,” Quantum , 2025
2025
Closest in time.
2025
Closest in time.
S. Stein, S. Xu, A. W. Cross, T. J. Yoder, A. Javadi-Abhari, C. Liu, K. Liu, Z. Zhou, C. Guinn, Y. Ding et al. , “HetEC: Architectures for heterogeneous quantum error correction codes,” in Proc. ACM Int. Conf. Architectural Support for Programming Languages & Operating Systems (ASPLOS) , 2025
2025
Closest in time.
Y. Wu, N. Liyanage, and L. Zhong, “Micro Blossom: Accelerated minimum-weight perfect matching decoding for quantum error correction,” in Proc. ACM Int. Conf. Architectural Support for Programming Languages & Operating Systems (ASPLOS) , 2025
2025
Closest in time.
Y. Wu, “Examples of visualization in MWPF package,” Apr. 2025. [Online]. Available: https://doi.org/10.5281/zenodo.15243982
2025
Closest in time.
B. Barber, K. M. Barnes, T. Bialas, O. Buğdaycı, E. T. Campbell, N. I. Gillespie, K. Johar, R. Rajan, A. W. Richardson, L. Skoric et al. , “A real-time, scalable, fast and resource-efficient decoder for a quantum computer,” Nature Electronics , 2025
2025
Closest in time.
N. Liyanage, Y. Wu, E. Houghton, and L. Zhong, “Network-integrated decoding system for real-time quantum error correction with lattice surgery,” in Proc. IEEE Int. Conf. Quantum Computing & Engineering (QCE) , 2025
2025
Closest in time.
2025
Closest in time.
N. Lacroix, A. Bourassa, F. J. Heras, L. M. Zhang, J. Bausch, A. W. Senior, T. Edlich, N. Shutty, V. Sivak, A. Bengtsson et al. , “Scaling and logic in the color code on a superconducting quantum processor,” Nature , 2025
2025
Closest in time.
A. S. Maan and A. Paler, “Machine learning message-passing for the scalable decoding of QLDPC codes,” npj Quantum Information , 2025
2025
Closest in time.
M. Lange, P. Havström, B. Srivastava, I. Bengtsson, V. Bergentall, K. Hammar, O. Heuts, E. van Nieuwenburg, and M. Granath, “Data-driven decoding of quantum error correcting codes using graph neural networks,” Physical Review Research , 2025
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 , 2025
2025
Closest in time.
2025
Closest in time.
C. Gidney, M. Newman, P. Brooks, and C. Jones, “Yoked surface codes,” Nature Communications , 2025
2025
Closest in time.