{
  "annotation_id": "5cda2390-5597-4261-bdbf-cae6b6ef735b",
  "date_created": "2026-02-17T05:53:24.064000Z",
  "date_modified": "2026-02-17T05:53:24.064000Z",
  "file_hash": "0e78c1eef21d1605e3436b2ec8a96c0f182450f31b2173472291ba7ca86296dd",
  "private": false,
  "record": {
    "abstract": "We study the computation of the $\\alpha$-R\\\u0027enyi capacity of a classical-quantum (c-q) channel for $\\alpha\\in(0,1)$. We propose an exponentiated-gradient (mirror descent) iteration that generalizes the Blahut-Arimoto algorithm. Our analysis establishes relative smoothness with respect to the entropy geometry, guaranteeing a global sublinear convergence of the objective values. Furthermore, under a natural tangent-space nondegeneracy condition (and a mild spectral lower bound in one regime), we prove local linear (geometric) convergence in Kullback-Leibler divergence on a truncated probability simplex, with an explicit contraction factor once the local curvature constants are bounded.",
    "arxiv_id": "2601.10558",
    "authors": [
      "Yu-Hong Lai",
      "Hao-Chung Cheng"
    ],
    "categories": [
      "quant-ph",
      "cs.IT",
      "math.IT",
      "math.OC"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "A Mirror-Descent Algorithm for Computing the Petz-R\\\u0027enyi Capacity of Classical-Quantum Channels",
    "url": "https://arxiv.org/abs/2601.10558",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "a9bfeb92-d309-4093-add6-acd3d8612018",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}