Heuristic search plus explicit verification yields certified upper bounds on the minimum distance of quantum APM-LDPC codes with girth-eight Tanner graphs.
Asymptotically good quantum and locally testable classical LDPC codes,
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
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.
Edge-coloring eliminates automorphisms in low-weight stabilizer subgraphs of generalized bicycle codes, enabling improved anisotropic min-sum decoding.
citing papers explorer
-
Heuristic Search for Minimum-Distance Upper-Bound Witnesses in Quantum APM-LDPC Codes
Heuristic search plus explicit verification yields certified upper bounds on the minimum distance of quantum APM-LDPC codes with girth-eight Tanner graphs.
-
A Two-Branch Finite-Field Construction for Regular CSS LDPC Bases
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.
-
Edge-Based Anisotropic Decoding for Generalized Bicycle Codes
Edge-coloring eliminates automorphisms in low-weight stabilizer subgraphs of generalized bicycle codes, enabling improved anisotropic min-sum decoding.