Fetching the paper…
Reading the bibliography…
Belief-propagation (BP) decoders play a vital role in modern coding theory, but they are not suitable to decode quantum error-correcting codes because of a unique quantum feature called error degeneracy.
R. G Gallager, “Low-density parity-check codes,” IEEE Trans. Inf. Theory 8
1962
Earlier work this paper cites.
J. Edmonds, “Paths, trees and flowers,” Canad. J. Math. 17
1965
Earlier work this paper cites.
Judea Pearl, “Reverend Bayes on inference engines: A distributed hierarchical approach,” Proc. Second Natl. Conf. Artif. Intell. AAAI-82
1982
Earlier work this paper cites.
M Mezard, G Parisi, and M Virasoro, Spin Glass Theory and Beyond , World Scientific Lecture Notes in Physics, Vol. 9 (WORLD SCIENTIFIC, 1986)
1986
Earlier work this paper cites.
D.J.C. MacKay, Graeme Mitchison, and P.L. McFadden, “Sparse-Graph Codes for Quantum Error Correction,” IEEE Trans. Inf. Theory 50
2004
Earlier work this paper cites.
Henk Wymeersch, Federico Penna, and Vladimir Savic, “Uniformly reweighted belief propagation: A factor graph approach,” in 2011 IEEE Int. Symp. Inf. Theory Proc. , 2 (IEEE, 2011) pp. 2000–2004
2004
Earlier work this paper cites.
Alexei Kitaev, “Anyons in an exactly solved model and beyond,” Ann. Phys. (N. Y). 321
2006
Earlier work this paper cites.
M. B. Hastings, “Quantum belief propagation: An algorithm for thermal quantum systems,” Phys. Rev. B 76
2007
Earlier work this paper cites.
Tom Richardson and Ruediger Urbanke, Modern Coding Theory (Cambridge University Press, Cambridge, 2008)
2008
Earlier work this paper cites.
2008
Earlier work this paper cites.
David Poulin and Ersen Bilgin, “Belief propagation algorithm for computing correlation functions in finite-temperature quantum many-body systems on loopy graphs,” Phys. Rev. A 77
2008
Earlier work this paper cites.
C. Laumann, A. Scardicchio, and S. L. Sondhi, “Cavity method for quantum spin glasses on the Bethe lattice,” Phys. Rev. B 78
2008
Earlier work this paper cites.
Guillaume Duclos-Cianci and David Poulin, “Fast Decoders for Topological Quantum Codes,” Phys. Rev. Lett. 104
2010
Earlier work this paper cites.
David Poulin and Matthew B Hastings, “Markov Entropy Decomposition: A Variational Dual for Quantum Belief Propagation,” Phys. Rev. Lett. 106
2011
Earlier work this paper cites.
Yun-Jiang Wang, Barry C Sanders, Bao-ming Bai, and Xin-mei Wang, “Enhanced Feedback Iterative Decoding of Sparse Quantum Codes,” IEEE Trans. Inf. Theory 58
2012
Cited alongside, same era.
Jean-Pierre Tillich and Gilles Zemor, “Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength,” IEEE Trans. Inf. Theory 60
2014
Cited alongside, same era.
Sergey Bravyi, Martin Suchara, and Alexander Vargo, “Efficient algorithms for maximum likelihood decoding in the surface code,” Phys. Rev. A 90
2014
Cited alongside, same era.
Daniel Gottesman, “Fault-tolerant quantum computation with constant overhead,” Quant. Info. and Comp. 14
2014
Cited alongside, same era.
Anthony Leverrier, Jean-Pierre Tillich, and Gilles Zemor, “Quantum Expander Codes,” in 2015 IEEE 56th Annu. Symp. Found. Comput. Sci. , Vol. 2015-Decem (IEEE, 2015) pp. 810–824
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
Savvas Varsamopoulos, Ben Criger, and Koen Bertels, “Decoding small surface codes with feedforward neural networks,” Quantum Sci. Technol. 3
2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2015
Cited alongside, same era.
Zunaira Babar, Panagiotis Botsinis, Dimitrios Alanis, Soon Xin Ng, and Lajos Hanzo, “Fifteen Years of Quantum LDPC Coding and Improved Decoding Strategies,” IEEE Access 3
2015
Cited alongside, same era.
2015
Cited alongside, same era.
Eliya Nachmani, Yair Be’ery, and David Burshtein, “Learning to decode linear codes using deep learning,” in 2016 54th Annu. Allert. Conf. Commun. Control. Comput. (IEEE, 2016) pp. 341–346
2016
Cited alongside, same era.
I Goodfellow, Y Bengio, and A Courville, Deep Learning (MIT Press, 2016)
2016
Cited alongside, same era.
2016
Cited alongside, same era.
Giacomo Torlai and Roger G. Melko, “Neural Decoder for Topological Codes,” Phys. Rev. Lett. 119
2017
Cited alongside, same era.
Stefan Krastanov and Liang Jiang, “Deep Neural Network Probabilistic Decoder for Stabilizer Codes,” Sci. Rep. 7
2017
Cited alongside, same era.
2018
Closest in time.
Christopher Chamberland and Pooya Ronagh, “Deep neural decoders for near term fault-tolerant experiments,” Quantum Sci. Technol. 3
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
Xiaotong Ni, “Neural Network Decoders for Large-Distance 2D Toric Codes,” arXiv:1809.06640 (2018)
2018
Closest in time.
2018
Closest in time.
Andrew S. Darmawan and David Poulin, “Linear-time general decoding algorithm for the surface code,” Phys. Rev. E 97
2018
Closest in time.
2018
Closest in time.