Unbounded Holevo additivity gaps in finite dimensions
quant-ph, cs.IT, math-ph, math.IT, math.MP
Submitted: 2026-09-16
Updated: 2026-10-05
Comments: 22+8pp; v2:added a short discussion of concurrent works; corrected estimates in Appendix B; added a Lean certificate: https://github.com/JWang226/Holevo-Additivity-Gap
License: http://creativecommons.org/licenses/by/4.0/
The gist: We establish unbounded two-use Holevo additivity gaps in finite dimensions.
Terminology
Abstract
We establish unbounded two-use Holevo additivity gaps in finite dimensions. For each sufficiently large fixed integer K and all sufficiently large n, we construct channels T n with output dimension K n, input dimension (Θ K(n 2)), and [ χ(T n squared)-2χ(T n) n [2K over K-2 2(1+9/K)]-O(1/n).] The gap is linear in output qubits, with an explicit quadratic input-qubit cost and an explicit threshold on n. We also obtain channels whose single-use Holevo quantity tends to zero while their two-use Holevo information, and hence classical capacity, diverges. The channels arise from structured tensor products of the complementary mixed-unitary channels used in Collins's free-probabilistic proof. We establish minimum-output-entropy gaps by combining Collins--Youn's product-group Haagerup inequality with Bordenave--Collins's quantitative strong-convergence estimates. We also provide a Lean certificate for our proofs.
Sources
- On some additivity problems in quantum information theory
- Non-additivity of Renyi entropy and Dvoretzky's Theorem
- Hastings' additivity counterexample via Dvoretzky's theorem
- Norm of matrix-valued polynomials in random unitaries and permutations
- Laws of large numbers for eigenvectors and eigenvalues associated to random subspaces in a tensor product
- Almost one bit violation for the additivity of the minimum output entropy
- On Hastings' counterexamples to the minimum output entropy additivity conjecture
- Towards a state minimizing the output entropy of a tensor product of random quantum channels
- Counterexamples to additivity of minimum output p-Renyi entropy for p close to 0
- The strong asymptotic freeness of Haar and deterministic matrices
- Random quantum channels I: graphical calculus and the Bell state phenomenon
- Random quantum channels II: Entanglement of random subspaces, Renyi entropy estimates and additivity problems
- Random matrix techniques in quantum information theory
- Haagerup's inequality and additivity violation of the Minimum Output Entropy
- Constructive counterexamples to the additivity of minimum output R'enyi entropy of quantum channels for all $p>1$
- Entanglement of random subspaces via the Hastings bound
- Comments on Hastings' Additivity Counterexamples
- Asymptotically well-behaved input states do not violate additivity for conjugate pairs of random quantum channels
- Additivity rates and PPT property for random quantum channels
- Revisiting additivity violation of 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
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians