On the Minimum Distances of Finite-Length Lifted Product Quantum LDPC Codes

P. Panteleev and G. Kalachev, “Degenerate quantum LDPC codes with good finite length performance,” Quantum , vol. 5, p. 585, 2021. [Online]. Available: http://arxiv.org/abs/1904.02703

Original

1904

Earlier work this paper cites.

D. Declercq and M. Fossorier, “Improved impulse method to evaluate the low weight profile of sparse binary linear codes,” in Proc. IEEE Int. Symp. on Inform. Theory , Toronto, Canada, Jul, 2008, pp. 1963–1967

1967

Earlier work this paper cites.

A. R. Calderbank and P. W. Shor, “Good quantum error-correcting codes exist,” Phys. Rev. A , vol. 54, pp. 1098–1105, Aug. 1996. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.54.1098

1996

Earlier work this paper cites.

A. M. Steane, “Simple quantum error-correcting codes,” Phys. Rev. A , vol. 54, no. 6, pp. 4741–4751, 1996

1996

Earlier work this paper cites.

D. Gottesman, “Stabilizer codes and quantum error correction,” Dissertation, California Institute of Technology, 1997. [Online]. Available: https://resolver.caltech.edu/CaltechETD:etd-07162004-113028

1997

Earlier work this paper cites.

A. Vardy, “The intractability of computing the minimum distance of a code,” IEEE Trans. on Inform. Theory , vol. 43, no. 6, pp. 1757–1766, Nov 1997

1997

Earlier work this paper cites.

D. J. MacKay and M. C. Davey, “Evaluation of Gallager codes for short block length and high rate applications,” in In Codes, Systems and Graphical Models . Springer-Verlag, 1999, pp. 113–130

1999

Earlier work this paper cites.

J. L. Fan, “Array codes as low-density parity-check codes,” in Proc. 2nd Intl. Symp. Turbo Codes and Related topics , Sept. 2000, pp. 543–546

2000

Earlier work this paper cites.

C. Berrou, S. Vaton, M. Jezequel, and C. Douillard, “Computing the minimum distance of linear codes by the error impulse method,” in Proc. IEEE Global Telecommun. Conf. , vol. 2, Tapei, Taiwan, Nov. 2002, pp. 1017–1020

2002

Earlier work this paper cites.

M. Fossorier, “Quasicyclic low-density parity-check codes from circulant permutation matrices,” IEEE Trans. on Inform. Theory , vol. 50, no. 8, pp. 1788–1793, Aug. 2004

2004

Earlier work this paper cites.

R. Tanner, D. Sridhara, A. Sridharan, T. Fuja, and D. Costello, “LDPC block and convolutional codes based on circulant matrices,” IEEE Trans. on Inform. Theory , vol. 50, no. 12, pp. 2966–2984, 2004

2004

Earlier work this paper cites.

D. Divsalar, S. Dolinar, and C. Jones, “Construction of protograph LDPC codes with linear minimum distance,” in Proc. IEEE Intl. Symp. on Inform. Theory , Seattle, WA USA, Jul. 2006, pp. 664–668

2006

Cited alongside, same era.

M. Hagiwara and H. Imai, “Quantum quasi-cyclic LDPC codes,” in Proc. IEEE Intl. Symp. on Inform. Theory , Jun. 2007, pp. 806–810

2007

Cited alongside, same era.

M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition , 10th ed. New York, NY, USA: Cambridge University Press, 2011

2011

Cited alongside, same era.

R. Smarandache and P. O. Vontobel, “Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds,” IEEE Trans. on Inform. Theory , vol. 58, no. 2, pp. 585–607, Feb. 2012

2012

Cited alongside, same era.

A. K. Pradhan, N. Raveendran, N. Rengaswamy, X. Xiao, and B. Vasić, “Learning to decode trapping sets in QLDPC codes,” in Proc. 12th Intl. Symp. Topics in Coding , Sep. 2023, pp. 1–5

2023

Later among the works it cites.

U. Kapshikar and S. Kundu, “On the hardness of the minimum distance problem of quantum codes,” IEEE Trans. on Inform. Theory , pp. 1–1, 2023

2023

Later among the works it cites.

Q. Xu, J. P. B. Ataides, C. A. Pattison, N. Raveendran, D. Bluvstein, J. Wurtz, B. Vasić, M. D. Lukin, L. Jiang, and H. Zhou, “Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays,” Nature Physics , pp. 1–10, April 2024. [Online]. Available: https://doi.org/10.1038/s41567-024-02479-z

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 , pp. 778–782, March 2024. [Online]. Available: https://doi.org/10.1038/s41586-024-07107-7

2024