Quantum Error Correction with Girth-16 Non-Binary LDPC Codes via Affine Permutation Construction
By: Kenta Kasai
Potential Business Impact:
Fixes computer errors better for faster, more reliable machines.
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.
Similar Papers
Construction and Decoding of Quantum Margulis Codes
Quantum Physics
Makes quantum computers work better and more reliably.
Quantum error correction beyond $SU(2)$ spin, bosonic, and permutation-invariant codes from convex geometry
Quantum Physics
Makes quantum computers more reliable and powerful.
Advancing Finite-Length Quantum Error Correction Using Generalized Bicycle Codes
Quantum Physics
Fixes computer mistakes in quantum computers.