arXiv:2610.08945
Efficiently computable bounds on the energy-constrained quantum reading capacity
Vishal Singh, Zixin Huang, Mark M. Wilde
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.
AI Summary
The paper studies the reading capacity of a finite family of finite-dimensional quantum channels under an average probe-energy constraint, allowing arbitrary adaptive operations and quantum memory between channel uses. It develops a numerically accessible converse and a procedure for finding non-adaptive achievable rates. The main converse is $R_{H,E}\le\inf_{\mathcal S,\lambda\in\mathbb R,\mu\ge0}(\lambda+\mu E)$, subject to $[\operatorname{Tr}_B\widehat D_{\mathrm{op}}(\Gamma^x,\Gamma^{\mathcal S})]^T\le\lambda I+\mu H$ for every channel label $x$. Here $\mathcal S$ is a reference channel and $\Gamma$ denotes a Choi operator. An input-dependent Belavkin–Staszewski relative-entropy chain rule bounds the information accumulated through an adaptive protocol; dualizing the energy constraint yields the operator inequalities. Existing operator-relative-entropy approximations give SDP formulations. Without an energy constraint, the bound becomes $\inf_{\mathcal S}\max_x\widehat D(\mathcal N^x\Vert\mathcal S)$. For achievability, semidefinite discretizations of an integral representation of Umegaki relative entropy yield bilinear lower approximations to the standard single-probe Holevo rate. Alternating optimization finds feasible probe states and encoding distributions, whose Holevo information can then be evaluated directly. For jointly classical–quantum channels, a Umegaki-based converse matches non-adaptive achievability without energy constraints, recovering a known capacity characterization. The lower-bound optimization has no global-optimality guarantee. Numerical examples cover qubit unitaries and loss–dephasing channels; the latter use finite-dimensional truncation without certified bosonic-capacity error bounds. Whether adaptivity improves energy-constrained reading capacity for jointly classical–quantum channels remains open.
Error found: Appendix A's finite-order semidefinite approximation can return approximately 0.9901 bits for two orthogonal replacer channels whose reading capacity is exactly 1 bit, so its uncorrected output is not necessarily a capacity upper bound.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 22+5 pages, 2 figures