Explicit channels with unbounded gains in classical communication using entangled inputs

arXiv:2609.26743 · quant-ph, cs.IT, math-ph, math.IT, math.MP · Submitted 2026-09-22 · Read on arXiv

quant-ph, cs.IT, math-ph, math.IT, math.MP

Submitted: 2026-09-22

Updated: 2026-10-05

Terminology

• Additivity — 21× in this paper · explained in 1 episode
• Trace — 17× in this paper · explained in 2 episodes
• Entanglement — 4× in this paper · explained in 3 episodes
• Superadditivity — 2× in this paper · explained in 2 episodes
• Generalization — 1× in this paper · explained in 13 episodes
• Stabilizer States — 1× in this paper · explained in 2 episodes

Sources

• Unbounded Holevo additivity gaps in finite dimensions
• Almost One Bit Violation of Minimum-Output R'enyi Entropy Additivity Simultaneously at All Orders
• Superadditivity of classical communication over quantum channels via random and deterministic permutations
• Counterexamples to additivity of minimum output p-R'enyi entropy of quantum channels for all p 0

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