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.
Degenerate quantum LDPC codes with good finite length performance
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
years
2026 5representative citing papers
Confidence-gated neural decoding escalates only ~3–6% of rotated-surface-code syndromes to MWPM and raises end-to-end accuracy from 99.21% to 99.81% at d=7 under circuit-level depolarising noise.
Dyadic matrices enable algebraic construction of QLDPC codes with enumerated short cycles and absorbing sets, yielding decoding gains in simulations even without higher girth.
citing papers explorer
-
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.
-
Latency-Constrained Hardware-Aware Quantum Error Correction Co-Design with Adaptive Confidence-Gated Neural Decoding for the Rotated Surface Code
Confidence-gated neural decoding escalates only ~3–6% of rotated-surface-code syndromes to MWPM and raises end-to-end accuracy from 99.21% to 99.81% at d=7 under circuit-level depolarising noise.
-
Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes
Dyadic matrices enable algebraic construction of QLDPC codes with enumerated short cycles and absorbing sets, yielding decoding gains in simulations even without higher girth.
- A Two-Branch Finite-Field Construction for Regular CSS LDPC Bases
- High-Girth Regular Quantum LDPC Codes from Square-Base Hypergraph Products via CPM Lifts