Metraipolis › archive › dc_aac4f4dc33de

Efficiently computable bounds on the energy-constrained quantum reading capacity — arXiv:2610.08945

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.08945
License (as archived)
CC0-1.0
Archived
2026-10-08T12:46:34.608Z
SHA-256 of the archived text
c93e7ef1fe7c7109e89826d8e42aa24631766371dd59d89adcf15680f2370e10
Stable URL of this page
https://metraipolis.com/documento/dc_aac4f4dc33de

How to cite

Efficiently computable bounds on the energy-constrained quantum reading capacity — arXiv:2610.08945 — arXiv (en), https://arxiv.org/abs/2610.08945 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_aac4f4dc33de (Metraipolis archive dc_aac4f4dc33de, sha256 c93e7ef1fe7c7109e89826d8e42aa24631766371dd59d89adcf15680f2370e10)
BibTeX
@misc{dcaac4f4dc33de,
  title = {Efficiently computable bounds on the energy-constrained quantum reading capacity — arXiv:2610.08945},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.08945},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_aac4f4dc33de; sha256 c93e7ef1fe7c7109e89826d8e42aa24631766371dd59d89adcf15680f2370e10},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.08945. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.08945 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T12:17:15.223Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).