{
  "abstract": "In quantum reading, classical messages are encoded in sequences of quantum channels and recovered by probing the channels and processing their outputs. We study the reading capacity of a finite family of finite-dimensional channels under an average constraint on the probing energy, allowing arbitrary adaptive operations between channel uses. Using an input-dependent chain rule for the Belavkin-Staszewski relative entropy, we derive a converse bound expressed as an optimization involving channel Choi operators and the operator relative entropy. This formulation admits semidefinite approximations and reduces, without an energy constraint, to a channel information radius. To obtain achievable rates, we construct bilinear semidefinite lower approximations to a standard non-adaptive reading bound. Alternating optimization produces feasible probe states and encoding distributions, whose Holevo information gives a directly evaluable achievable rate. For jointly classical-quantum channels, we derive a separate converse based on the Umegaki relative entropy. Without an energy constraint, this converse matches a non-adaptive achievable rate, recovering a recent result of Pascual Abraldes and Winter: non-adaptive protocols suffice to achieve the unconstrained reading capacity of jointly classical-quantum channels.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.08945",
  "author_total": 3,
  "authors": [
    {
      "name": "Vishal Singh"
    },
    {
      "name": "Zixin Huang"
    },
    {
      "name": "Mark M. Wilde"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/eb0bbr8sbf0de.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.08945",
  "fulltext_url": null,
  "id": "eb0bbr8sbf0de",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.08945",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.IT"
    ],
    [
      "arxiv",
      "math.IT"
    ],
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Information and Cryptography"
    ]
  ],
  "openalex": "W7221050991",
  "pdf_url": "https://arxiv.org/pdf/2610.08945",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-06",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/eb0bbr8sbf0de.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:27:37Z",
      "native_id": "2610.08945",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.08945"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.IT",
      "subfield": "general"
    },
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Efficiently computable bounds on the energy-constrained quantum reading capacity",
  "title_text": "Efficiently computable bounds on the energy-constrained quantum reading capacity",
  "type": "preprint",
  "updated_at": "2026-10-30T12:27:42Z",
  "url": "https://research.draconitic.com/paper/eb0bbr8sbf0de",
  "venue": "arXiv",
  "versions": []
}