{
  "annotation_id": "0ddc82e1-7aad-45ea-a698-cf4404a7f58c",
  "date_created": "2026-03-02T18:01:45.507000Z",
  "date_modified": "2026-03-02T18:01:45.507000Z",
  "file_hash": "55cea47f401a08ceaf6a2b6114de53c56922c5a11975b126b8bea8e192dc916b",
  "private": false,
  "record": {
    "abstract": "We generalize the random coding argument of stabilizer codes and derive a\nlower bound on the quantum capacity of an arbitrary discrete memoryless quantum\nchannel. For the depolarizing channel, our lower bound coincides with that\nobtained by Bennett et al. We also slightly improve the quantum\nGilbert-Varshamov bound for general stabilizer codes, and establish an analogue\nof the quantum Gilbert-Varshamov bound for linear stabilizer codes. Our proof\nis restricted to the binary quantum channels, but its extension of to l-adic\nchannels is straightforward.",
    "arxiv_id": "quant-ph/0105151",
    "authors": [
      "Ryutaroh Matsumoto",
      "Tomohiko Uyematsu"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1063/1.1497999",
    "journal_ref": "J. Math. Phys., vol. 43, no. 9, pp. 4391-4403, Sept. 2002",
    "title": "Lower bound for the quantum capacity of a discrete memoryless quantum   channel",
    "url": "https://arxiv.org/abs/quant-ph/0105151"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "03db4c8c-b64c-49f4-bb2f-3d91ebeffcea",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}