{
  "annotation_id": "eed45aee-f8e2-461a-8968-411d077d793b",
  "date_created": "2026-03-02T18:02:34.539000Z",
  "date_modified": "2026-03-02T18:02:34.539000Z",
  "file_hash": "7302888da833c78bacd8e9a15d1ef9d54b99e1676aac089aae00bbd44ec4eb43",
  "private": false,
  "record": {
    "abstract": "We prove direct quantum coding theorem for random quantum codes. The problem\nis separated into two parts: proof of distinguishability of codewords by\nreceiver, and that of indistinguishability of codewords by environment\n(privacy). For a large class of codes, only privacy has to be checked.",
    "arxiv_id": "quant-ph/0702006",
    "authors": [
      "Michal Horodecki",
      "Seth Lloyd",
      "Andreas Winter"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "Open Syst. Inf. Dyn. 15 (2008) 47-69",
    "title": "Quantum coding theorem from privacy and distinguishability",
    "url": "https://arxiv.org/abs/quant-ph/0702006"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "9220e585-2e74-4e2c-aeaf-0d223c83501f",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}