Classical Capacity and Entanglement Cost of the Amplitude Damping Channel
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
- The Capacity of Quantum Channel with General Signal States
- Superadditivity of communication capacity using entangled inputs
- Information-theoretic aspects of the generalized amplitude damping channel
- The capacity of a quantum channel for simultaneous transmission of classical and quantum information
- Entangled inputs cannot make imperfect quantum channels perfect
- Semidefinite programming strong converse bounds for classical capacity
- Approaches for approximate additivity of the Holevo information of quantum channels
- A hierarchy of efficient bounds on quantum capacities exploiting symmetry
- The classical capacity of generalized amplitude-damping channels and its strong-converse exponent
- A Factorization Law for Entanglement Decay
- Computable lower bounds on the entanglement cost of quantum channels
- A note on extremal decomposition of covariances
- Remarks on additivity of the Holevo channel capacity and of the entanglement of formation
- Equivalence of Additivity Questions in Quantum Information Theory
- Entanglement cost and quantum channel simulation
- Entanglement of Formation of an Arbitrary State of Two Qubits
- The asymptotic entanglement cost of preparing a quantum state
- Optimal signal ensembles
- Lean-QIT: Towards a Formal Infrastructure for Quantum Information Theory
- The Quantum Reverse Shannon Theorem based on One-Shot Information Theory
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians