aiqbench analysis
This paper presents a significant theoretical advance in quantum information theory by constructing explicit quantum channels that violate Rényi entropy additivity above any positive order using direct products of free groups and high-girth graphs. The authors demonstrate their method achieves superior efficiency compared to previous constructions, requiring fewer output qubits for arbitrary target gaps while maintaining real algebraic entries. Such closed-form finite-dimensional solutions deepen our understanding of non-additive properties in quantum channels, which is fundamental for refining bounds on quantum channel capacities and entropy inequalities.
Closed-Form Arbitrary-Gap R\'enyi Nonadditivity Above Any Positive Order via Direct Products of Free Groups and High-Girth Graphs
arXiv:2610.06533v1 Announce Type: new Abstract: We give a closed-form finite-dimensional construction of quantum channels with real algebraic entries exhibiting arbitrarily large violations of minimum-output R\'enyi entropy additivity uniformly above any prescribed positive R\'enyi order, using a different finite realization based on direct products of free groups and fixed-field high-girth graphs. More precisely, for every $p_0>0$ and $g>0$, we construct one channel and one Bell input for which the additivity gap is greater than $g$ simultaneously for all $p\in[p_0,\infty]$. With $r=\lceil2g\rceil$, the construction uses $15r$ output qubits and $O(r2^{30r}+r^2(1+p_0^{-1}))$ input qubits. Compared with the stated parameters of Shou and Gorshkov \cite{ShouGorshkov2026}, our construction uses fewer output qubits for every target gap and has a smaller asymptotic input-qubit bound as the gap grows with the positive cutoff fixed. At the von Neumann order, a separate specialization gives an explicit channel with gap greater than $1/1024$ using $37608898$ input qubits and $8$ output qubits.
Abstract:We give a closed-form finite-dimensional construction of quantum channels with real algebraic entries exhibiting arbitrarily large violations of minimum-output Rényi entropy additivity uniformly above any prescribed positive Rényi order, using a different finite realization based on direct products of free groups and fixed-field high-girth graphs. More precisely, for every $p_0>0$ and $g>0$, we construct one channel and one Bell input for which the additivity gap is greater than $g$ simultaneously for all $p\in[p_0,\infty]$. With $r=\lceil2g\rceil$, the construction uses $15r$ output qubits and $O(r2^{30r}+r^2(1+p_0^{-1}))$ input qubits. Compared with the stated parameters of Shou and Gorshkov \cite{ShouGorshkov2026}, our construction uses fewer output qubits for every target gap and has a smaller asymptotic input-qubit bound as the gap grows with the positive cutoff fixed. At the von Neumann order, a separate specialization gives an explicit channel with gap greater than $1/1024$ using $37608898$ input qubits and $8$ output qubits.
arXiv:2610.06533 [quant-ph]
(or arXiv:2610.06533v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2610.06533 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 · 237 words
Related coverage

The Entangled Dimensions of Decision Theory
LessWrong · Jul 30, 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · Aug 15, 2026

An unexamined cause of the OpenAI Hugging Face hacking incident: its binary performance metric
LessWrong · Sep 23, 2026
Links #3: 2026/06 Part 1
LessWrong · Jun 15, 2026