Skip to content
Preprint

Unbounded Holevo additivity gaps in finite dimensions

Sep 2026 · 2 citations · ⚡ 1 influential · 40 references
Physics Computer Science Mathematics

TL;DR

This work establishes minimum-output-entropy gaps by combining Collins--Youn's product-group Haagerup inequality with Bordenave--Collins's quantitative strong-convergence estimates and provides a Lean certificate for the proofs.

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 $\exp(\Theta_K(n^2))$, and \[ \chi(T_n^{\otimes2})-2\chi(T_n) \ge n\left[\frac{\log_2K}{K}-2\log_2(1+9/K)\right]-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.

View source

Similar papers

Preprint Aug 2026

The S-matrix conjecture

Harwit and Sloane conjectured that every nonsingular entrywise-nonnegative matrix $A\in\mathbb R^{n\times n}$ satisfies $\|A^{-1}\|_F\ge 2n(n+1)^{-1}\|A\|_{\max}^{-1}$, with equality precisely for positive multiples of $S$-matrices. Cheng proved the conjecture in odd dimensions, while Frankel and Urschel proved the eve...

Yin-Jie Li · 0 citations
Preprint Aug 2026

Difference-Set Weyl Channels: Exact Capacity, Optimizer Bifurcation, and Scalable Entanglement Separation

In odd local dimension $D$, complete Wigner positivity yields stochastic phase-space dynamics on Wigner-nonnegative states but does not control signed inputs, entanglement across channel uses, or collective decoding. Using a subsystem-resolved Weyl decomposition, we characterize the equality conditions of the tensor-st...

Se-Wan Ji · 0 citations
Preprint Aug 2026

(Almost) quadruply optimal unitary designs in 1D

We construct $n$-qubit approximate unitary $k$-designs in 1D systems, achieving circuit depth $O(\log(n/\varepsilon) + k\log k)$ with relative error $\varepsilon$ and requiring $O(nk\log k)$ magic gates. This matches existing lower bounds $\Omega(\log(n/\varepsilon) + k)$ for circuit depth, and $\widetilde{\Omega}(nk)$...

Guoding Liu, J. Helsen · 3 citations · ⚡1
Preprint Sep 2026

On the geometry and typicality of quantum magic

We prove that, for an $n$-qubit system of dimension $d=2^n$, every state satisfying $\operatorname{Tr}(\rho^2)\le 1/(d-a_\ast)$, with $a_\ast=0.458327\cdots$, lies inside the stabilizer polytope and is therefore magic-free. Combining this result with general geometric properties of high-dimensional polytopes, we establ...

Zhen-Huan Liu, Zi-Wen Liu · 2 citations
Preprint Sep 2026

Learning Random Quantum Circuits and the Emergence of Pseudorandomness

We give an efficient algorithm for learning $k$-dimensional brickwork random quantum circuits using only copies of the output state obtained by applying $U$ to the all-zero input. For a depth-$d$ circuit on $n$ sites with random $2\ell$-qubit gates, the algorithm learns the original circuit $U$ with high probability in...

Srinivasan Arunachalam, Qi-Zhao Huang, Makrand Sinha · 0 citations
Preprint Sep 2026

SparseStack Is an Optimal Oblivious Subspace Embedding

It is proved that fully independent SparseStack achieves the oblivious subspace embedding parameters conjectured by Nelson and Nguyen (FOCS 2013) and the main theorem has been formally verified in Lean 4.

Diar Heidary · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.