The exact strong converse exponent for private communication over quantum channels

arXiv:2609.38144 · quant-ph, cs.IT, math.IT · Submitted 2026-09-29 · Read on arXiv

quant-ph, cs.IT, math.IT

Submitted: 2026-09-29

Updated: 2026-09-29

Terminology

• Fidelity — 56× in this paper · explained in 2 episodes
• Trace — 38× in this paper · explained in 2 episodes
• Regularization — 8× in this paper · explained in 3 episodes
• Additivity — 6× in this paper · explained in 1 episode
• Homogeneity — 4× in this paper · explained in 2 episodes
• Entanglement — 3× in this paper · explained in 4 episodes
• Trace Distance — 3× in this paper · explained in 3 episodes
• Superadditivity — 2× in this paper · explained in 2 episodes
• Consistency — 1× in this paper · explained in 3 episodes
• Generalization — 1× in this paper · explained in 13 episodes
• Self-consistency — 1× in this paper · explained in 2 episodes

Sources

• The private classical capacity and quantum capacity of a quantum channel
• Converse bounds for private communication over quantum channels
• "Pretty strong" converse for the quantum capacity of degradable channels
• "Pretty strong" converse for the private capacity of degraded quantum wiretap channels
• On Strong Converse Bounds for the Private and Quantum Capacities of Anti-degradable Channels
• An exponential strong converse for private communication over degradable quantum channels
• Strong Converse for a Degraded Wiretap Channel via Active Hypothesis Testing
• Wiretap channel capacity: Secrecy criteria, strong converse, and phase change
• Strong Converse using Change of Measure Arguments
• Exact Random Coding Secrecy Exponents for the Wiretap Channel
• Multiplicativity of completely bounded $p$-norms implies a strong converse for entanglement-assisted capacity
• Strong Converse Exponent for Entanglement-Assisted Communication
• Strong converse exponent for classical-quantum channel coding
• The operational meaning of min- and max-entropy
• Superadditivity of private information for any number of uses of the channel
• Concavity of certain matrix trace and norm functions. II
• Concavity of certain matrix trace and norm functions
• Monotonicity of a relative R'enyi entropy
• Simple and Tighter Derivation of Achievability for Classical Communication over Quantum Channels

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
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity