{
  "annotation_id": "3349c81f-15b7-418a-8b43-127eba584b52",
  "date_created": "2026-02-17T05:53:26.461000Z",
  "date_modified": "2026-02-17T05:53:26.461000Z",
  "file_hash": "3b8372e8b79baa23f87f298bce25b6936fae0121a37e82e3fd0385da3a824e3d",
  "private": false,
  "record": {
    "abstract": "We introduce a quantum Maxwell erasure decoder for CSS quantum low-density parity-check (qLDPC) codes that extends peeling with bounded guessing. Guesses are tracked symbolically and can be eliminated by restrictive checks, giving a tunable tradeoff between complexity and performance via a guessing budget: an unconstrained budget recovers Maximum-Likelihood (ML) performance, while a constant budget yields linear-time decoding and approximates ML. We provide theoretical guarantees on asymptotic performance and demonstrate strong performance on bivariate bicycle and quantum Tanner codes.",
    "arxiv_id": "2601.10713",
    "authors": [
      "Bruno Costa Alves Freire",
      "Fran\u00e7ois-Marie Le R\u00e9gent",
      "Anthony Leverrier"
    ],
    "categories": [
      "quant-ph",
      "cs.IT",
      "math.IT"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "Quantum Maxwell Erasure Decoder for qLDPC codes",
    "url": "https://arxiv.org/abs/2601.10713",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "f385857f-add8-4f99-8152-eff4286bab16",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}