An exponential strong converse for private communication over degradable quantum channels

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

quant-ph, cs.IT, math.IT

Submitted: 2026-09-26

Updated: 2026-09-26

Terminology

• Fidelity — 33× in this paper · explained in 2 episodes
• Trace — 29× in this paper · explained in 2 episodes
• Entanglement — 11× in this paper · explained in 4 episodes
• Hilbert Space — 10× in this paper · explained in 2 episodes
• Verification — 4× in this paper · explained in 2 episodes
• Additivity — 3× in this paper · explained in 1 episode
• Decode — 2× in this paper · explained in 2 episodes
• Decoupling — 1× in this paper · explained in 2 episodes
• Formal Verification — 1× in this paper · explained in 2 episodes
• Trace Distance — 1× in this paper · explained in 3 episodes

Sources

• Sharp Quantum Capacity Thresholds: Exponential Strong Converses for Degradable and Antidegradable Channels
• On Strong Converse Bounds for the Private and Quantum Capacities of Anti-degradable Channels
• One-shot decoupling
• The private classical capacity and quantum capacity of a quantum channel
• The capacity of a quantum channel for simultaneous transmission of classical and quantum information
• A note on quantum algorithms and the minimal degree of epsilon-error polynomials for symmetric functions
• Quantum key distribution based on private states: unconditional security over untrusted channels with zero quantum capacity
• Unconditional privacy over channels which cannot convey quantum information
• General paradigm for distilling classical key from quantum states
• Random quantum codes from Gaussian ensembles and an uncertainty relation
• "Pretty strong" converse for the quantum capacity of degradable channels
• Sine distance for quantum states
• Total insecurity of communication via strong converse for quantum privacy amplification
• A Framework for Non-Asymptotic Quantum Information Theory
• Sequential decoding of a general classical-quantum channel
• Position-based coding and convex splitting for private communication over quantum channels
• Converse bounds for private 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