Fetching the paper…
Reading the bibliography…
Quantum low-density parity-check (QLDPC) codes are among the most promising candidates for future quantum error correction schemes.
A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane, “Quantum error correction via codes over GF(4)
1998
Earlier work this paper cites.
M. C. Davey and D. J. MacKay, “Low density parity check codes over GF(q)
1998
Earlier work this paper cites.
T. Etzion, A. Trachtenberg and A. Vardy, “Which codes have cycle-free Tanner graphs?,” IEEE Trans. Inf. Theory , vol. 45, no. 6, 1999
1999
Earlier work this paper cites.
Y. Kou, S. Lin, and M. Fossorier, “Low-density parity-check codes based on finite geometries: a rediscovery and new results,” IEEE Trans. Inf. Theory , vol. 47, no. 7, 2001
2001
Earlier work this paper cites.
D. J. MacKay, G. Mitchison, and P. L. McFadden, “Sparse-graph codes for quantum error correction,” IEEE Trans. Inf. Theory , vol. 50, no. 10, 2004
2004
Earlier work this paper cites.
S. Lin and D. J. Costello, Jr., Error Control Coding: Fundamentals and Applications . Prentice-Hall, 2004
2004
Earlier work this paper cites.
M. Hagiwara and H. Imai, “Quantum quasi-cyclic LDPC codes,” in Proc. ISIT , 2007
2007
Earlier work this paper cites.
D. Declercq and M. Fossorier, “Decoding algorithms for nonbinary LDPC codes over GF(q)
2007
Cited alongside, same era.
T. Hehn, J. B. Huber, S. Laendner, and O. Milenkovic, “Multiple-bases belief-propagation for decoding of short block codes,” in Proc. ISIT , 2007
2007
Cited alongside, same era.
S. A. Aly, “A class of quantum LDPC codes constructed from finite geometries,” in Proc. GLOBECOM , 2008
2008
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 , vol. 58, no. 2, 2012
2012
Cited alongside, same era.
J.-P. Tillich and G. Zémor, “Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength,” IEEE Trans. Inf. Theory , vol. 60, no. 2, 2013
2013
Cited alongside, same era.
V. Aref, N. Macris, and M. Vuffray, “Approaching the rate-distortion limit with spatial coupling, belief propagation, and decimation,” IEEE Trans. Inf. Theory , vol. 61, no. 7, 2015
2015
Later among the works it cites.
J. Roffe, D. R. White, S. Burton, and E. Campbell, “Decoding across the quantum low-density parity-check code landscape,” Physical Review Research , vol. 2, no. 4, 2020
2020
Later among the works it cites.
C.-Y. Lai and K.-Y. Kuo, “Log-domain decoding of quantum LDPC codes over binary finite fields,” IEEE Trans. Quantum Eng. , vol. 2, 2021
2021
Later among the works it cites.
P. Panteleev and G. Kalachev, “Degenerate quantum LDPC codes with good finite length performance,” Quantum , vol. 5, 2021
2021
Later among the works it cites.
P. Panteleev and G. Kalachev, “Asymptotically good quantum and locally testable classical LDPC codes,” in Proc. SIGACT Symposium on Theory of Computing , 2022
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
D. Gottesman, “Fault-tolerant quantum computation with constant overhead,” Quantum Information and Computation , vol. 14, 2014
2014
Cited alongside, same era.
Z. Babar, P. Botsinis, D. Alanis, S. X. Ng, and L. Hanzo, “Fifteen years of quantum LDPC coding and improved decoding strategies” IEEE Access , vol. 3, 2015
2015
Cited alongside, same era.
2022
Later among the works it cites.