{
  "annotation_id": "20548adc-a26c-4293-8a2d-6af1834516c4",
  "date_created": "2026-03-02T18:02:09.662000Z",
  "date_modified": "2026-03-02T18:02:09.662000Z",
  "file_hash": "f6dc68f4a9512a4e3dd7b333cb55e1085d482240acc6fc4fb70bd6cf3ff43ee2",
  "private": false,
  "record": {
    "abstract": "We present an iterative algorithm that finds the optimal measurement for\nextracting the accessible information in any quantum communication scenario.\nThe maximization is achieved by a steepest-ascent approach toward the extremal\npoint, following the gradient uphill in sufficiently small steps. We apply it\nto a simple ad-hoc example, as well as to a problem with a bearing on the\nsecurity of a tomographic protocol for quantum key distribution.",
    "arxiv_id": "quant-ph/0408134",
    "authors": [
      "Jaroslav \u0158eh\u00e1\u010dek",
      "Berthold-Georg Englert",
      "Dagomir Kaszlikowski"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.71.054303",
    "journal_ref": "Physical Review A 71 (2005) 054303 (4 pages)",
    "title": "Iterative procedure for computing accessible information in quantum   communication",
    "url": "https://arxiv.org/abs/quant-ph/0408134"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "837c9726-791f-4c80-abc8-1899a5f5fa3d",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}