arXiv:2609.28592
Classical Capacity and Entanglement Cost of the Amplitude Damping Channel
Ziao Tang, Chengkai Zhu, Ge Bai, Xin Wang
Abstract
Determining a noisy quantum channel's classical capacity and entanglement cost generally requires regularization over many channel uses. We remove both regularizations for every qubit-to-qubit channel admitting a pure output. For each such channel, Holevo information, channel entanglement of formation, and parallel entanglement cost are additive with those of any finite-dimensional partner channel. This class includes all qubit-to-qubit channels of Kraus rank at most two. For the amplitude damping channel with damping probability $p$, the unassisted classical capacity equals the known single-use Holevo information, attained by a binary pure-state ensemble with collective decoding, and the entanglement cost is $h_2((1+\sqrt p)/2)$ ebits per use. The common mechanism is a support criterion for strong superadditivity of entanglement of formation: one marginal has no support on the sector in which both local systems are orthogonal to fixed distinguished vectors. We prove this criterion in arbitrary finite dimensions using a triangular block-matrix entropy inequality and decompositions preserving two expectations. For amplitude damping, we also derive an exact finite-block Holevo deficit, identify the unique optimal average input for $p<1$, and construct a binary Kraus representation attaining the uniform formation bound.
AI Summary
The paper addresses whether entangled encodings increase the classical capacity of the qubit amplitude-damping channel beyond its known single-use Holevo information, and whether regularization is necessary for its entanglement cost. It establishes both rates for the larger class of qubit-to-qubit channels admitting a pure output, including every channel of Kraus rank at most two. For every channel $\mathcal N$ in this class, $C(\mathcal N)=\chi(\mathcal N)$ and its parallel LOCC simulation cost equals the entanglement of formation of its normalized Choi state. Holevo information, classical capacity, channel entanglement of formation, and parallel entanglement cost are additive with arbitrary finite-dimensional partner channels. For amplitude damping with probability $p$, the capacity is the previously known optimization $\max_{0\le q\le1}\{h_2((1-p)q)-h_2((1+\sqrt{1-4p(1-p)q^2})/2)\}$, attained by an equiprobable opposite-phase binary pure-state ensemble. The entanglement cost is $h_2((1+\sqrt p)/2)$ ebits per use. The central state-level result proves strong superadditivity of entanglement of formation when one marginal excludes the sector where both local systems are orthogonal to distinguished vectors. Its proof combines a triangular block-matrix entropy inequality with decompositions preserving two expectations. Applying this criterion to Stinespring images and Choi states supplies the channel converses. Further results include an exact finite-block Holevo-deficit identity, uniqueness of the optimal average input for $p<1$, and an explicit binary Kraus instrument giving a uniform formation bound. The simulation result concerns parallel tensor-power approximation in diamond norm, not adaptive tests. Finite-temperature generalized amplitude damping, strong-converse thresholds, and reliability functions remain unresolved.
Frontier Large Language Models were used for the proof of~\Cref{thm:support} and~\Cref{thm:triangle}.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 21+8 pages, 1 figure