REVIEW 2 cited by
Quantum Error Correction with Girth-16 Non-Binary LDPC Codes via Affine Permutation Construction
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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.
Forward citations
Cited by 2 Pith papers
-
Pair-Partition Constructions for CPM-Based Quantum LDPC Codes
A pair-partition rule for CPM exponents produces CSS-orthogonal quantum LDPC codes, and a complete, symmetry-reduced search certifies exact minimum distances for 34 finite codes.
-
Efficient Mitigation of Error Floors in Quantum Error Correction using Non-Binary Low-Density Parity-Check Codes
A cycle-classification post-processing step corrects Type-I and Type-III trapping errors in non-binary quantum LDPC decoding, significantly lowering the error floor while leaving Type-II errors uncorrected.
Discussion (0). Continue with ORCID to comment.