Quantum Error Correction with Girth-16 Non-Binary LDPC Codes via Affine Permutation Construction

April 24, 2025 Β· Declared Dead Β· πŸ› International Symposium on Turbo Codes and Iterative Information Processing

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Kenta Kasai arXiv ID 2504.17790 Category quant-ph: Quantum Computing Cross-listed cs.IT Citations 3 Venue International Symposium on Turbo Codes and Iterative Information Processing Last Checked 5 months ago
Abstract
We propose a method for constructing quantum error-correcting codes based on non-binary low-density parity-check codes with Tanner graph girth 16. While conventional constructions using circulant permutation matrices are limited to girth 12, our method employs affine permutation matrices and a randomized sequential selection procedure to eliminate short cycles and achieve girth 16. Numerical experiments show that the proposed codes significantly reduce the number of low-weight codewords. Joint belief propagation decoding over depolarizing channels reveals that although a slight degradation appears in the waterfall region, a substantial improvement is achieved in the error floor performance. We also evaluated the minimum distance and found that the proposed codes achieve a larger upper bound compared to conventional constructions.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

Died the same way β€” πŸ‘» Ghosted