Strong Converses for Quantum Channel Capacities from Blowing-Up Lemmata
Abstract
A quantum channel can transmit quantum states, classical messages, or classical messages that remain secret from its environment. We prove exponential strong converses for all three tasks over arbitrary finite-dimensional memoryless quantum channels, at their respective regularized capacities and allowing arbitrary entangled inputs across channel uses and joint decoding. Above quantum or classical capacity, entanglement fidelity or decoding success probability, respectively, decays exponentially with the number of channel uses. Above private capacity, fidelity to an ideal shared secret key decays exponentially; in particular, vanishing secrecy error forces decoding success to vanish. The proofs combine one-shot quantum blowing-up lemmas, which convert codes with low success into reliable codes with a controlled loss in code size, with a low-degree polynomial approximation of the channel's Stinespring image projector. The loss is governed by the projective tensor norm of the approximation across the receiver--environment bipartition. For memoryless channels, the polynomial construction gives exponential accuracy while keeping the rate loss arbitrarily small, turning the corresponding weak converses into strong converses.
Related
- Exact series formulas for the capacities of the amplitude damping channel
- Energy-constrained two-way capacities of the pure-loss channel
- Energy-constrained two-way capacities of pure-loss and quantum-limited amplifier channels
- A Counterexample to the Optimality Conjecture in Convex Quantum Channel Optimization
- Quantum Channel Stein Theorem beyond Definite Causal Order
BibTeX
@misc{beigi2026strong,
title = {{Strong Converses for Quantum Channel Capacities from Blowing-Up Lemmata}},
author = {Salman Beigi and Marco Tomamichel},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.11771},
eprint = {2609.11771},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.11771},
}
RIS
TY - UNPB
TI - Strong Converses for Quantum Channel Capacities from Blowing-Up Lemmata
AU - Salman Beigi
AU - Marco Tomamichel
PY - 2026
DA - 2026/09/30
PB - arXiv
DO - 10.48550/arxiv.2609.11771
UR - https://arxiv.org/abs/2609.11771
AB - A quantum channel can transmit quantum states, classical messages, or classical messages that remain secret from its environment. We prove exponential strong converses for all three tasks over arbitrary finite-dimensional memoryless quantum channels, at their respective regularized capacities and allowing arbitrary entangled inputs across channel uses and joint decoding. Above quantum or classical capacity, entanglement fidelity or decoding success probability, respectively, decays exponentially with the number of channel uses. Above private capacity, fidelity to an ideal shared secret key decays exponentially; in particular, vanishing secrecy error forces decoding success to vanish. The proofs combine one-shot quantum blowing-up lemmas, which convert codes with low success into reliable codes with a controlled loss in code size, with a low-degree polynomial approximation of the channel's Stinespring image projector. The loss is governed by the projective tensor norm of the approximation across the receiver--environment bipartition. For memoryless channels, the polynomial construction gives exponential accuracy while keeping the rate loss arbitrarily small, turning the corresponding weak converses into strong converses.
ER -