aiqbench analysis
This paper presents a deterministic polynomial-time algorithm that constructs specific permutations to prove the nonadditivity of minimum-output-entropy in quantum channels, refining the geometric understanding of quantum information bounds. By combining Haagerup's inequality with spectral approximation techniques, the work establishes a rigorous entropy gap that translates into superadditivity for the one-shot Holevo quantity. These theoretical advances deepen our comprehension of fundamental limits in quantum communication and channel capacity without relying on probabilistic methods.
Deterministic Minimum-Output-Entropy Nonadditivity via Haagerup's Inequality and Near-Free Permutation Representations
arXiv:2608.31081v1 Announce Type: new Abstract: We give a deterministic realization of the finite-dimensional quadratic certificate underlying Collins's mixed-unitary proof of minimum-output-entropy nonadditivity. For every fixed integer $K\ge 2$ and rational $\eta>0$ satisfying $\log K>2(3+\eta)^2$, a deterministic polynomial-time algorithm, for every sufficiently large target size $N$, outputs $K$ permutations on $N'=N+o_{K,\eta}(N)$ points. Restricting their permutation matrices to the nontrivial standard representation yields real orthogonal Stinespring blocks and a channel $\Phi_{N'}:M_{N'-1}(\mathbb{C})\to M_K(\mathbb{C})$ such that \[ 2H_{\min}(\Phi_{N'}) -H_{\min}(\Phi_{N'}^{\otimes 2}) \ge \frac{\log K}{K} -2\log\left(1+\frac{(3+\eta)^2}{K}\right) >0. \] The construction combines Haagerup's length-two inequality with the simultaneous deterministic spectral approximation of O'Donnell and Wu. We further show that the constant $3$ is asymptotically sharp on the relevant Hermitian zero-diagonal coefficient class and that the finite spectral transfer is nearly saturated, thereby isolating the finer geometry of the full output body as the natural next level of refinement beyond the scalar-radius method. Finally, a standard covariant extension converts the same deterministic entropy gap exactly into self-tensor superadditivity of the one-shot Holevo quantity.
Abstract:We give a deterministic realization of the finite-dimensional quadratic certificate underlying Collins's mixed-unitary proof of minimum-output-entropy nonadditivity. For every fixed integer $K\ge 2$ and rational $\eta>0$ satisfying $\log K>2(3+\eta)^2$, a deterministic polynomial-time algorithm, for every sufficiently large target size $N$, outputs $K$ permutations on $N'=N+o_{K,\eta}(N)$ points. Restricting their permutation matrices to the nontrivial standard representation yields real orthogonal Stinespring blocks and a channel $\Phi_{N'}:M_{N'-1}(\mathbb{C})\to M_K(\mathbb{C})$ such that \[ 2H_{\min}(\Phi_{N'}) -H_{\min}(\Phi_{N'}^{\otimes 2}) \ge \frac{\log K}{K} -2\log\left(1+\frac{(3+\eta)^2}{K}\right) >0. \] The construction combines Haagerup's length-two inequality with the simultaneous deterministic spectral approximation of O'Donnell and Wu. We further show that the constant $3$ is asymptotically sharp on the relevant Hermitian zero-diagonal coefficient class and that the finite spectral transfer is nearly saturated, thereby isolating the finer geometry of the full output body as the natural next level of refinement beyond the scalar-radius method. Finally, a standard covariant extension converts the same deterministic entropy gap exactly into self-tensor superadditivity of the one-shot Holevo quantity.
26 pages. Feedback and comments are welcome
arXiv:2608.31081 [quant-ph]
(or arXiv:2608.31081v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2608.31081 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 258 words
Related coverage
Unbounded Holevo additivity gaps in finite dimensions
arXiv · Sep 17, 2026
Information-Theoretic Analysis of Next-Token Prediction under Markovian Data
arXiv · Sep 30, 2026
Quantum Channels Defy Entropy Additivity, University of Waterloo Finds
Quantum Zeitgeist · Aug 26, 2026
Counterexamples to additivity of minimum output $p$-R\'enyi entropy of quantum channels for all $p\ge 0$
arXiv · Oct 6, 2026