Classical Capacity and Entanglement Cost of the Amplitude Damping Channel

arXiv:2609.28592 · quant-ph · Submitted 2026-09-23 · Read on arXiv

quant-ph

Submitted: 2026-09-23

Updated: 2026-09-23

Comments: 21+8 pages, 1 figure

License: http://creativecommons.org/licenses/by/4.0/

The gist: Determining a noisy quantum channel's classical capacity and entanglement cost generally requires regularization over many channel uses.

Terminology

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.

Sources

Related papers