Fetching the paper…
Reading the bibliography…
We propose a post-processing method for message-passing (MP) decoding of CSS quantum LDPC codes, called stabilizer-inactivation (SI).
1904
Earlier work this paper cites.
R. G. Gallager, “Low-density parity-check codes,” IRE Trans. on Information Theory , vol. 8, no. 1, pp. 21–28, 1962
1962
Earlier work this paper cites.
R. M. Tanner, “A recursive approach to low complexity codes,” IEEE Transactions on Information Theory , vol. 27, no. 5, pp. 533–547, 1981
1981
Earlier work this paper cites.
J. Pearl, “Reverend Bayes on inference engines: A distributed hierarchical approach,” in Proc. of the 2nd National Conference on Artificial Intelligence (AAAI-82) , 1982, pp. 133–136
1982
Earlier work this paper cites.
N. Wiberg, “Codes and decoding on general graphs,” Ph.D. dissertation, Likoping University, Sweden, 1996
1996
Earlier work this paper cites.
T. J. Richardson and R. L. Urbanke, “The capacity of low-density parity-check codes under message-passing decoding,” IEEE Trans. on Inf. Theory , vol. 47, no. 2, pp. 599–618, 2001
2001
Earlier work this paper cites.
T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, “Design of capacity-approaching irregular low-density parity-check codes,” IEEE Trans. on Information Theory , vol. 47, no. 2, pp. 619–637, 2001
2001
Earlier work this paper cites.
2005
Earlier work this paper cites.
E. Sharon, S. Litsyn, and J. Goldberger, “Efficient serial message-passing schedules for LDPC decoding,” IEEE Trans. on Inf. Theory , vol. 53, no. 11, pp. 4076–4091, 2007
2007
Earlier work this paper cites.
D. Poulin and Y. Chung, “On the iterative decoding of sparse quantum codes,” Quantum Information and Computation , vol. 8, no. 10, pp. 987–1000, 2008
2008
Earlier work this paper cites.
2013
Cited alongside, same era.
P. Schläfer, N. Wehn, M. Alles, and T. Lehnigk-Emden, “A new dimension of parallelism in ultra high throughput LDPC decoding,” in SiPS 2013 Proceedings . IEEE, 2013, pp. 153–158
2013
Cited alongside, same era.
G. H. Golub and C. F. Van Loan, Matrix computations . JHU press, 2013
2013
Cited alongside, same era.
A. A. Kovalev and L. P. Pryadko, “Quantum kronecker sum-product low-density parity-check codes with finite rate,” Phys. Rev. A , vol. 88, p. 012311, Jul 2013. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.88.012311
2013
Cited alongside, same era.
Y.-H. Liu and D. Poulin, “Neural belief-propagation decoders for quantum error-correcting codes,” Physical review letters , vol. 122, no. 20, p. 200501, 2019
2019
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
N. P. Breuckmann and J. N. Eberhardt, “Balanced product quantum codes,” arXiv:2012.09271 , 2020
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
V. Savin, “LDPC decoders,” in Channel coding: Theory, algorithms, and applications , D. Declercq, M. Fossorier, and E. Biglieri, Eds. Elsevier, 2014, pp. 211–260
2014
Cited alongside, same era.
E. Boutillon and G. Masera, “Hardware design and realization for iteratively decodable codes,” in Channel coding: Theory, algorithms, and applications , D. Declercq, M. Fossorier, and E. Biglieri, Eds. Elsevier, 2014, pp. 583–642
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, pp. 2492–2519, 2015
2015
Cited alongside, same era.
A. Leverrier, J.-P. Tillich, and G. Zémor, “Quantum expander codes,” in IEEE Annual Symposium on Foundations of Computer Science . IEEE, 2015, pp. 810–824
2015
Cited alongside, same era.
O. Fawzi, A. Grospellier, and A. Leverrier, “Efficient decoding of random errors for quantum expander codes,” in Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing , 2018, pp. 521–534
2018
Cited alongside, same era.
2021
Later among the works it cites.
N. Raveendran and B. Vasić, “Trapping Sets of Quantum LDPC Codes,” Quantum , vol. 5, p. 562, Oct. 2021. [Online]. Available: https://doi.org/10.22331/q-2021-10-14-562
2021
Later among the works it cites.
A. Leverrier and G. Zémor, “Quantum Tanner codes,” arXiv:2202.13641 , 2022
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.