Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Belief Propagation Decoding of Quantum LDPC Codes with Guided Decimation (2312.10950v2)

Published 18 Dec 2023 in cs.IT, math.IT, and quant-ph

Abstract: Quantum low-density parity-check (QLDPC) codes have emerged as a promising technique for quantum error correction. A variety of decoders have been proposed for QLDPC codes and many of them utilize belief propagation (BP) decoding in some fashion. However, the use of BP decoding for degenerate QLDPC codes is known to have issues with convergence. These issues are typically attributed to short cycles in the Tanner graph and code degeneracy (i.e. multiple error patterns with the same syndrome). Although various methods have been proposed to mitigate the non-convergence issue, such as BP with ordered statistics decoding (BP-OSD) and BP with stabilizer inactivation (BP-SI), achieving better performance with lower complexity remains an active area of research. In this work, we propose a decoder for QLDPC codes based on BP guided decimation (BPGD), which has been previously studied for constraint satisfaction and lossy compression problems. The decimation process is applicable to both binary and quaternary BP and it involves sequentially fixing the value of the most reliable qubits to encourage BP convergence. Despite its simplicity, We find that BPGD significantly reduces the BP failure rate due to non-convergence, achieving performance on par with BP with ordered statistics decoding and BP with stabilizer inactivation, without the need to solve systems of linear equations.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (59)
  1. A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. Sloane, “Quantum error correction and orthogonal geometry,” Physical Review Letters, vol. 78, no. 3, p. 405, 1997.
  2. A. R. Calderbank, E. M. Rains, P. M. Shor, and N. J. Sloane, “Quantum error correction via codes over GF(4),” IEEE Transactions on Information Theory, vol. 44, no. 4, pp. 1369–1387, 1998.
  3. A. Y. Kitaev, “Quantum computations: algorithms and error correction,” Russian Mathematical Surveys, vol. 52, no. 6, p. 1191, 1997.
  4. ——, “Fault-tolerant quantum computation by anyons,” Annals of physics, vol. 303, no. 1, pp. 2–30, 2003.
  5. E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, “Topological quantum memory,” Journal of Mathematical Physics, vol. 43, no. 9, pp. 4452–4505, 2002.
  6. M. H. Freedman, D. A. Meyer, and F. Luo, “Z2subscript𝑍2{Z_{2}}italic_Z start_POSTSUBSCRIPT 2 end_POSTSUBSCRIPT-systolic freedom and quantum codes,” Mathematics of quantum computation, Chapman & Hall/CRC, pp. 287–320, 2002.
  7. S. Bravyi, D. Poulin, and B. Terhal, “Tradeoffs for reliable quantum information storage in 2D systems,” Physical review letters, vol. 104, no. 5, p. 050503, 2010.
  8. A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, “Surface codes: Towards practical large-scale quantum computation,” Physical Review A, vol. 86, no. 3, p. 032324, 2012.
  9. D. Horsman, A. G. Fowler, S. Devitt, and R. Van Meter, “Surface code quantum computing by lattice surgery,” New Journal of Physics, vol. 14, no. 12, p. 123011, 2012.
  10. D. J. MacKay, G. Mitchison, and P. L. McFadden, “Sparse-graph codes for quantum error correction,” IEEE Transactions on Information Theory, vol. 50, no. 10, pp. 2315–2330, 2004.
  11. 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 Transactions on Information Theory, vol. 60, no. 2, pp. 1193–1202, 2013.
  12. A. A. Kovalev and L. P. Pryadko, “Improved quantum hypergraph-product LDPC codes,” in 2012 IEEE International Symposium on Information Theory Proceedings.   IEEE, 2012, pp. 348–352.
  13. ——, “Quantum kronecker sum-product low-density parity-check codes with finite rate,” Physical Review A, vol. 88, no. 1, p. 012311, 2013.
  14. J. Haah, “Local stabilizer codes in three dimensions without string logical operators,” Physical Review A, vol. 83, no. 4, p. 042330, 2011.
  15. P. Panteleev and G. Kalachev, “Degenerate quantum LDPC codes with good finite length performance,” Quantum, vol. 5, p. 585, 2021.
  16. S. Yang and R. Calderbank, “Quantum spatially-coupled codes,” arXiv preprint arXiv:2305.00137, 2023.
  17. M. B. Hastings, J. Haah, and R. O’Donnell, “Fiber bundle codes: breaking the N1/2superscript𝑁12{N}^{1/2}italic_N start_POSTSUPERSCRIPT 1 / 2 end_POSTSUPERSCRIPTpolylog(N𝑁{N}italic_N) barrier for quantum LDPC codes,” in Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, pp. 1276–1288.
  18. N. P. Breuckmann and J. N. Eberhardt, “Balanced product quantum codes,” IEEE Transactions on Information Theory, vol. 67, no. 10, pp. 6653–6674, 2021.
  19. P. Panteleev and G. Kalachev, “Quantum LDPC codes with almost linear minimum distance,” IEEE Transactions on Information Theory, vol. 68, no. 1, pp. 213–229, 2021.
  20. ——, “Asymptotically good quantum and locally testable classical LDPC codes,” in Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022, pp. 375–388.
  21. R. Gallager, “Low-density parity-check codes,” IRE Transactions on information theory, vol. 8, no. 1, pp. 21–28, 1962.
  22. “Digital video broadcasting (DVB); Second generation framing structure, channel coding and modulation systems for broadcasting, interactive services, news gathering and other broad-band satellite applications,” EN 302 307, European Telecommunications Standards Institute (ETSI).
  23. T. Richardson and S. Kudekar, “Design of low-density parity check codes for 5G new radio,” IEEE Communications Magazine, vol. 56, no. 3, pp. 28–34, 2018.
  24. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, “Factor graphs and the sum-product algorithm,” IEEE Transactions on information theory, vol. 47, no. 2, pp. 498–519, 2001.
  25. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, “Efficient erasure correcting codes,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 569–584, 2001.
  26. ——, “Improved low-density parity-check codes using irregular graphs,” IEEE Transactions on information Theory, vol. 47, no. 2, pp. 585–598, 2001.
  27. T. J. Richardson and R. L. Urbanke, “The capacity of low-density parity-check codes under message-passing decoding,” IEEE Transactions on information theory, vol. 47, no. 2, pp. 599–618, 2001.
  28. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, “Design of capacity-approaching irregular low-density parity-check codes,” IEEE transactions on information theory, vol. 47, no. 2, pp. 619–637, 2001.
  29. D. Poulin and Y. Chung, “On the iterative decoding of sparse quantum codes,” arXiv preprint arXiv:0801.1241, 2008.
  30. 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.
  31. N. Raveendran and B. Vasić, “Trapping sets of quantum LDPC codes,” Quantum, vol. 5, p. 562, 2021.
  32. Y.-J. Wang, B. C. Sanders, B.-M. Bai, and X.-M. Wang, “Enhanced feedback iterative decoding of sparse quantum codes,” IEEE transactions on information theory, vol. 58, no. 2, pp. 1231–1241, 2012.
  33. A. Rigby, J. Olivier, and P. Jarvis, “Modified belief propagation decoders for quantum low-density parity-check codes,” Physical Review A, vol. 100, no. 1, p. 012330, 2019.
  34. 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.
  35. X. Xiao, N. Raveendran, and B. Vasić, “Neural-net decoding of quantum LDPC codes with straight-through estimators,” in in Proc. Information Theory and Applications Workshop (ITA), 2019.
  36. S. Miao, A. Schnerring, H. Li, and L. Schmalen, “Neural belief propagation decoding of quantum LDPC codes using overcomplete check matrices,” in 2023 IEEE Information Theory Workshop (ITW).   IEEE, 2023, pp. 215–220.
  37. J. Old and M. Rispler, “Generalized belief propagation algorithms for decoding of surface codes,” Quantum, vol. 7, p. 1037, 2023.
  38. K.-Y. Kuo and C.-Y. Lai, “Exploiting degeneracy in belief propagation decoding of quantum codes,” npj Quantum Information, vol. 8, no. 1, p. 111, 2022.
  39. J. Du Crest, M. Mhalla, and V. Savin, “Stabilizer inactivation for message-passing decoding of quantum LDPC codes,” in 2022 IEEE Information Theory Workshop (ITW).   IEEE, 2022, pp. 488–493.
  40. M. Mézard, G. Parisi, and R. Zecchina, “Analytic and algorithmic solution of random satisfiability problems,” Science, vol. 297, no. 5582, pp. 812–815, 2002.
  41. A. Montanari, F. Ricci-Tersenghi, and G. Semerjian, “Solving constraint satisfaction problems through belief propagation-guided decimation,” arXiv preprint arXiv:0709.1667, 2007.
  42. A. Coja-Oghlan, “On belief propagation guided decimation for random k𝑘kitalic_k-SAT,” in Proceedings of the twenty-second annual ACM-SIAM symposium on discrete algorithms.   SIAM, 2011, pp. 957–966.
  43. T. Filler and J. Fridrich, “Binary quantization using belief propagation with decimation over factor graphs of LDGM codes,” arXiv preprint arXiv:0710.0192, 2007.
  44. V. Aref, N. Macris, and M. Vuffray, “Approaching the rate-distortion limit with spatial coupling, belief propagation, and decimation,” IEEE Transactions on Information Theory, vol. 61, no. 7, pp. 3954–3979, 2015.
  45. A. Buchberger, C. Häger, H. D. Pfister, L. Schmalen, and A. G. i Amat, “Learned decimation for neural belief propagation decoders,” in ICASSP 2021-2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).   IEEE, 2021, pp. 8273–8277.
  46. A. R. Calderbank and P. W. Shor, “Good quantum error-correcting codes exist,” Physical Review A, vol. 54, no. 2, p. 1098, 1996.
  47. A. Steane, “Multiple-particle interference and quantum error correction,” Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, vol. 452, no. 1954, pp. 2551–2577, 1996.
  48. P. Iyer and D. Poulin, “Hardness of decoding quantum stabilizer codes,” IEEE Transactions on Information Theory, vol. 61, no. 9, pp. 5209–5223, 2015.
  49. E. Berlekamp, R. McEliece, and H. Van Tilborg, “On the inherent intractability of certain coding problems (corresp.),” IEEE Transactions on Information Theory, vol. 24, no. 3, pp. 384–386, 1978.
  50. J. Pearl, “Reverend Bayes on inference engines: A distributed hierarchical approach,” in Proceedings of the Second National Conference on Artificial Intelligence, 1982, pp. 133–136.
  51. C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1,” in Proceedings of ICC’93-IEEE International Conference on Communications, vol. 2.   IEEE, 1993, pp. 1064–1070.
  52. R. J. McEliece, D. J. C. MacKay, and J.-F. Cheng, “Turbo decoding as an instance of Pearl’s “belief propagation” algorithm,” IEEE Journal on selected areas in communications, vol. 16, no. 2, pp. 140–152, 1998.
  53. S. M. Aji and R. J. McEliece, “The generalized distributive law,” IEEE transactions on Information Theory, vol. 46, no. 2, pp. 325–343, 2000.
  54. M. Mézard and G. Parisi, “The Bethe lattice spin glass revisited,” The European Physical Journal B-Condensed Matter and Complex Systems, vol. 20, pp. 217–233, 2001.
  55. 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, p. 043423, 2020.
  56. E. Sharon, S. Litsyn, and J. Goldberger, “Efficient serial message-passing schedules for LDPC decoding,” IEEE Transactions on Information Theory, vol. 53, no. 11, pp. 4076–4091, 2007.
  57. J. Goldberger and H. Kfir, “Serial schedules for belief-propagation: analysis of convergence time,” IEEE Transactions on Information Theory, vol. 54, no. 3, pp. 1316–1319, 2008.
  58. K.-Y. Kuo and C.-Y. Lai, “Refined belief propagation decoding of sparse-graph quantum codes,” IEEE Journal on Selected Areas in Information Theory, vol. 1, no. 2, pp. 487–498, 2020.
  59. C.-Y. Lai and K.-Y. Kuo, “Log-domain decoding of quantum LDPC codes over binary finite fields,” IEEE Transactions on Quantum Engineering, vol. 2, pp. 1–15, 2021.
Citations (8)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now