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.
The capacity of low-density parity-check codes under message-passing decoding
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2representative citing papers
Constructs explicit regular high-girth quantum LDPC codes from square-base hypergraph products and CPM lifts, including a [[28800,62]] (3,6)-regular code with zero observed decoding failures in 2.993e8 trials at p=0.1402.
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.
-
High-Girth Regular Quantum LDPC Codes from Square-Base Hypergraph Products via CPM Lifts
Constructs explicit regular high-girth quantum LDPC codes from square-base hypergraph products and CPM lifts, including a [[28800,62]] (3,6)-regular code with zero observed decoding failures in 2.993e8 trials at p=0.1402.