Pith. sign in

REVIEW 5 cited by

Explicit Construction of Quantum Quasi-Cyclic Low-Density Parity-Check Codes with Column Weight 2 and Girth 12

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 2501.13444 v2 pith:TSKCP3M4 submitted 2025-01-23 cs.IT math.ITquant-ph

Explicit Construction of Quantum Quasi-Cyclic Low-Density Parity-Check Codes with Column Weight 2 and Girth 12

classification cs.IT math.ITquant-ph
keywords codesgirthquantummethodparity-checkconstructioncorrectionerror
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This study proposes an explicit construction method for quantum quasi-cyclic low-density parity-check (QC-LDPC) codes with a girth of 12. The proposed method designs parity-check matrices that maximize the girth while maintaining an orthogonal structure suitable for quantum error correction. By utilizing algebraic techniques, short cycles are eliminated, which improves error correction performance. Additionally, this method is extended to non-binary LDPC codes and spatially-coupled LDPC codes, demonstrating that both the girth and orthogonality can be preserved. The results of this study enable the design of high-performance quantum error-correcting codes without the need for random search.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 5 Pith papers

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

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

    quant-ph 2026-07 conditional novelty 7.0

    A new pair-partition rule builds CSS-orthogonal CPM quantum LDPC codes and a complete search algorithm certifies their exact minimum distances; 22 finite codes with certified distances are reported.

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

    quant-ph 2026-07 accept novelty 6.0

    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.

  3. A Two-Branch Finite-Field Construction for Regular CSS LDPC Bases

    quant-ph 2026-05 unverdicted novelty 6.0

    A finite-field two-branch coset construction generates regular CSS LDPC bases for multiple (J,L) pairs, with a (3,10) example lifted 64-fold to a [[10240,4108,10≤d≤32]] code and post-processed FER of 1e-7 at p=0.058.

  4. High-Girth Regular Quantum LDPC Codes from Affine-Coset Structures

    quant-ph 2026-04 unverdicted novelty 6.0

    A new [[16384,4142,≤40]] quantum LDPC code family is obtained by CPM-lifting a girth-8 base CSS code, achieving frame error rate ~10^{-8} at depolarizing noise p=0.085.

  5. Quasi-Orthogonal Stabilizer Design for Efficient Quantum Error Suppression

    quant-ph 2026-04 unverdicted novelty 6.0

    Quasi-orthogonal stabilizer codes relax orthogonality constraints to achieve higher logical rates and up to two orders of magnitude better error suppression under depolarizing noise.