Pith. sign in

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

arxiv 2504.17790 v2 pith:IEIUFR3Q submitted 2025-04-24 quant-ph cs.ITmath.IT

classification quant-phcs.ITmath.IT
keywords codesgirthpermutationachieveaffineconstructionsconventionalerror
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Pair-Partition Constructions for CPM-Based Quantum LDPC Codes

    quant-ph 2026-07 conditional novelty 7.0 of 10

    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.

  2. Efficient Mitigation of Error Floors in Quantum Error Correction using Non-Binary Low-Density Parity-Check Codes

    quant-ph 2025-01 conditional novelty 6.0 of 10

    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.

Pith tools