Efficiently computable bounds on the energy-constrained quantum reading capacity
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.
Related
- Efficiently and Reliably Measuring Information Processing Capacity in Dynamical Systems via Kernels
- Asymmetric Quantum Error Correction Efficiently Tackles Application-Specific Noise Effects
- Capacity-Constrained Wasserstein Barycenters: Existence, Duality, and Entropic Regularization
- Constrained Capacity for Faster-than-Nyquist Signaling in Frequency-Selective Fading Channels
- Energy-constrained two-way capacity bounds for noisy Gaussian channels
BibTeX
@misc{singh2026efficiently,
title = {{Efficiently computable bounds on the energy-constrained quantum reading capacity}},
author = {Vishal Singh and Zixin Huang and Mark M. Wilde},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.08945},
eprint = {2610.08945},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.08945},
}
RIS
TY - UNPB
TI - Efficiently computable bounds on the energy-constrained quantum reading capacity
AU - Vishal Singh
AU - Zixin Huang
AU - Mark M. Wilde
PY - 2026
DA - 2026/10/06
PB - arXiv
DO - 10.48550/arxiv.2610.08945
UR - https://arxiv.org/abs/2610.08945
AB - 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.
ER -