Heuristic search plus explicit verification yields certified upper bounds on the minimum distance of quantum APM-LDPC codes with girth-eight Tanner graphs.
Quantum error correction beyond the bounded distance decoding limit,
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
Joint BP on coupled binary factor graphs and four-state BP for CSS decoding produce identical results after relabeling Pauli states and marginalizing irrelevant components.
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.
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 Factor-Graph Formulation of CSS Syndrome Decoding: Joint BP and Four-State BP
Joint BP on coupled binary factor graphs and four-state BP for CSS decoding produce identical results after relabeling Pauli states and marginalizing irrelevant components.
-
High-Girth Regular Quantum LDPC Codes from Affine-Coset Structures
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.