{
  "annotation_id": "e0b1fdc2-e09e-4631-b70d-aec19c7cfebc",
  "date_created": "2026-02-17T05:53:24.049000Z",
  "date_modified": "2026-02-17T05:53:24.049000Z",
  "file_hash": "1b33c0aca596ebb7b4efb15c728e8d388321758fe41eea8d6f9e76b73345ede6",
  "private": false,
  "record": {
    "abstract": "The aim of this work is to study the zero-error capacity of pure-state classical-quantum channels in the setting of list decoding. We provide an achievability bound for list-size two and a converse bound holding for every fixed list size. The two bounds coincide for channels whose pairwise absolute state overlaps form a positive semi-definite matrix. Finally, we discuss a remarkable peculiarity of the classical-quantum case: differently from the fully classical setting, the rate at which the sphere-packing bound diverges might not be achievable by zero-error list codes, even when we take the limit of fixed but arbitrarily large list size.",
    "arxiv_id": "2601.09786",
    "authors": [
      "Marco Dalai",
      "Filippo Girardi",
      "Ludovico Lami"
    ],
    "categories": [
      "quant-ph",
      "cs.IT",
      "math-ph",
      "math.IT",
      "math.MP"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "Zero-Error List Decoding for Classical-Quantum Channels",
    "url": "https://arxiv.org/abs/2601.09786",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "564810e7-64c1-49a5-adf5-607e0d838448",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}