{
  "annotation_id": "3f338ae3-c491-4ea1-aebf-49e0da8ab58e",
  "date_created": "2026-02-17T05:53:16.144000Z",
  "date_modified": "2026-02-17T05:53:16.144000Z",
  "file_hash": "fac3479abb610c3abb2b5e932e108184e0fc83dddb87a86be64f0f50ef114269",
  "private": false,
  "record": {
    "abstract": "Quantum low-density parity-check (QLDPC) codes provide a practical balance between error-correction capability and implementation complexity in quantum error correction (QEC). In this paper, we propose an algebraic construction based on dyadic matrices for designing both classical and quantum LDPC codes. The method first generates classical binary quasi-dyadic LDPC codes whose Tanner graphs have girth 6. It is then extended to the Calderbank-Shor-Steane (CSS) framework, where the two component parity-check matrices are built to satisfy the compatibility condition required by the recently introduced CAMEL-ensemble quaternary belief propagation decoder. This compatibility condition ensures that all unavoidable cycles of length 4 are assembled in a single variable node, allowing the mitigation of their detrimental effects by decimating that variable node.",
    "arxiv_id": "2601.08636",
    "authors": [
      "Alessio Baldelli",
      "Massimo Battaglioni",
      "Jonathan Mandelbaum",
      "Sisi Miao",
      "Laurent Schmalen"
    ],
    "categories": [
      "cs.IT",
      "math.IT",
      "quant-ph"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "Quantum CSS LDPC Codes based on Dyadic Matrices for Belief Propagation-based Decoding",
    "url": "https://arxiv.org/abs/2601.08636",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "fbd2957b-f77f-49b0-b8ee-d68d5a9f446f",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}