Skip to content
DraconiticResearch
Search Sources API
181,716 studies31 sourcesUpdated 48 min ago
PreprintarXiv licencearXiv

The classical capacity of generalized amplitude-damping channels and its strong-converse exponent

Abstract

The classical capacity of a quantum channel generally requires regularization because input codewords may be entangled across channel uses. We remove this regularization for generalized amplitude-damping channels (GADCs) and determine their exact strong-converse exponent throughout the full parameter range. The exponent is a single-letter transform of the sandwiched Rényi Holevo information and is attained by product input codewords with collective decoding. The key ingredient is a decomposition of the joint output into positive operators whose triangular factors have identical scalar Gram matrices after norm compression. A sharp triangular Schatten-norm compression inequality then establishes maximum output norm multiplicativity for diagonally sandwiched GADCs tensored with arbitrary completely positive maps. This yields additivity of the sandwiched Rényi Holevo information at every order above one. Consequently, the classical capacity equals the known one-copy Holevo information and admits a scalar optimization. Thus, entangled input codewords improve neither the capacity nor the optimal exponential decay of decoding success above capacity.

Related

  1. Unlocking Exponential and Unbounded Robust Gains in Shannon Capacity of Classical Multiple Access Channels with Causal CSIT via Quantum Entanglement Assistance
    Yuhang Yao, Syed A. Jafar
    arXivPreprintarXiv licenceFull textGeneral mathematicsQuantum physics & quantum informationarXiv
  2. Classical Capacity of Single-Mode Bosonic Gaussian Channels
    Gerardo Adesso, Ludovico Lami, Vittorio Giovannetti
    arXivPreprintCC BY 4.0Full textMathematical physicsQuantum physics & quantum informationarXiv
  3. The exact strong converse exponent for private communication over quantum channels
    Hao-Chung Cheng, Christoph Hirche, Marco Tomamichel
    arXivPreprintarXiv licenceFull textGeneral mathematicsQuantum physics & quantum informationarXiv
  4. Diagnosing the Refuted Mismatched Decoding Converse for Binary-Input Channels
    Jonathan Scarlett
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  5. An exponential strong converse for private communication over degradable quantum channels
    Mark M. Wilde
    arXivPreprintarXiv licenceFull textGeneral mathematicsQuantum physics & quantum informationarXiv
BibTeX
@misc{fang2026classical,
  title = {{The classical capacity of generalized amplitude-damping channels and its strong-converse exponent}},
  author = {Kun Fang},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2609.14621},
  eprint = {2609.14621},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.14621},
}
RIS
TY  - UNPB
TI  - The classical capacity of generalized amplitude-damping channels and its strong-converse exponent
AU  - Kun Fang
PY  - 2026
DA  - 2026/10/06
PB  - arXiv
DO  - 10.48550/arxiv.2609.14621
UR  - https://arxiv.org/abs/2609.14621
AB  - The classical capacity of a quantum channel generally requires regularization because input codewords may be entangled across channel uses. We remove this regularization for generalized amplitude-damping channels (GADCs) and determine their exact strong-converse exponent throughout the full parameter range. The exponent is a single-letter transform of the sandwiched Rényi Holevo information and is attained by product input codewords with collective decoding. The key ingredient is a decomposition of the joint output into positive operators whose triangular factors have identical scalar Gram matrices after norm compression. A sharp triangular Schatten-norm compression inequality then establishes maximum output norm multiplicativity for diagonally sandwiched GADCs tensored with arbitrary completely positive maps. This yields additivity of the sandwiched Rényi Holevo information at every order above one. Consequently, the classical capacity equals the known one-copy Holevo information and admits a scalar optimization. Thus, entangled input codewords improve neither the capacity nor the optimal exponential decay of decoding success above capacity.
ER  -