Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Low-Complexity Linear Programming Based Decoding of Quantum LDPC codes (2311.18488v2)

Published 30 Nov 2023 in cs.IT and math.IT

Abstract: This paper proposes two approaches for reducing the impact of the error floor phenomenon when decoding quantum low-density parity-check codes with belief propagation based algorithms. First, a low-complexity syndrome-based linear programming (SB-LP) decoding algorithm is proposed, and second, the proposed SB-LP is applied as a post-processing step after syndrome-based min-sum (SB-MS) decoding. For the latter case, a new early stopping criterion is introduced to decide when to activate the SB-LP algorithm, avoiding executing a predefined maximum number of iterations for the SB-MS decoder. Simulation results show, for a sample hypergraph code, that the proposed decoder can lower the error floor by two to three orders of magnitude compared to SB-MS for the same total number of decoding iterations.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (18)
  1. F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. Brandao, D. A. Buell et al., “Quantum supremacy using a programmable superconducting processor,” Nature, vol. 574, no. 7779, pp. 505–510, 2019.
  2. A. R. Calderbank and P. W. Shor, “Good quantum error-correcting codes exist,” Phys. Rev. A, vol. 54, pp. 1098–1105, Aug 1996.
  3. 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.
  4. J. R. Wootton and D. Loss, “High Threshold Error Correction for the Surface Code,” Physical Review Letters, vol. 109, no. 16, oct 2012.
  5. 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.
  6. P. Panteleev and G. Kalachev, “Asymptotically Good Quantum and Locally Testable Classical LDPC Codes,” in Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, ser. STOC 2022, 2022, p. 375–388.
  7. N. P. Breuckmann and J. N. Eberhardt, “Quantum low-density parity-check codes,” PRX Quantum, vol. 2, no. 4, p. 040101, 2021.
  8. N. Raveendran and B. Vasić , “Trapping Sets of Quantum LDPC Codes,” Quantum, vol. 5, p. 562, oct 2021.
  9. N. Raveendran, M. Bahrami, and B. Vasic, “Syndrome-generalized belief propagation decoding for quantum memories,” in ICC 2019-2019 IEEE International Conference on Communications (ICC).   IEEE, 2019, pp. 1–6.
  10. 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.
  11. P. Panteleev and G. Kalachev, “Degenerate quantum LDPC codes with good finite length performance,” Quantum, vol. 5, p. 585, nov 2021.
  12. J. Valls, F. Garcia-Herrero, N. Raveendran, and B. Vasić, “Syndrome-based Min-sum vs OSD-0 decoders: FPGA Implementation and Analysis for Quantum LDPC codes,” IEEE Access, vol. 9, pp. 138 734–138 743, 2021.
  13. 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.
  14. J. Feldman, M. J. Wainwright, and D. R. Karger, “Using linear programming to decode binary linear codes,” IEEE Transactions on Information Theory, vol. 51, no. 3, pp. 954–972, 2005.
  15. J. X. Li and P. O. Vontobel, “LP decoding of quantum stabilizer codes,” in 2018 IEEE International Symposium on Information Theory (ISIT).   IEEE, 2018, pp. 1306–1310.
  16. O. Fawzi, L. Grouès, and A. Leverrier, “Linear programming decoder for hypergraph product quantum codes,” in 2020 IEEE Information Theory Workshop (ITW).   IEEE, 2021, pp. 1–5.
  17. M. P. Fossorier, M. Mihaljevic, and H. Imai, “Reduced complexity iterative decoding of low-density parity check codes based on belief propagation,” IEEE Transactions on communications, vol. 47, no. 5, pp. 673–680, 1999.
  18. P. O. Vontobel and R. Koetter, “Towards Low-Complexity Linear-Programming Decoding,” in 4th International Symposium on Turbo Codes & Related Topics; 6th International ITG-Conference on Source and Channel Coding, 2006, pp. 1–9.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Sana Javed (1 paper)
  2. Francisco Garcia-Herrero (4 papers)
  3. Bane Vasic (77 papers)
  4. Mark F. Flanagan (76 papers)

Summary

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

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