Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1003.4925 · Communications in Mathematical Physics

Hastings’s Additivity Counterexample via Dvoretzky’s Theorem

Guillaume Aubrun, Stanisław J. Szarek, Elisabeth Werner

Published Nov 25, 2010• 92 citations
arXivHTMLPDF
DOI
10.1007/s00220-010-1172-y

Related papers

Comments on Hastings’ Additivity Counterexamples

Motohisa Fukuda, Christopher King, David K. Moser

arXiv:0905.3697•Communications in Mathematical Physics•Feb 3, 2010•60 citations

Revision, technical aspects and reproduction of the Hastings' counterexample of the additivity conjecture of the Holevo capacity

Camilo Arturo Zapata Ocampo

•Jan 1, 2014•0 citations

Approximate Unitary n^{2/3}-Designs Give Rise to Quantum Channels with Super Additive Classical Holevo Capacity

Aditya Nema, Sen, Pranab

In a breakthrough, Hastings' showed that there exist quantum channels whose classical capacity is superadditive i.e. more classical information can be transmitted by quantum encoding strategies entangled across multiple channel uses as compared to unentangled quantum encoding strategies. Hastings' proof used Haar random unitaries to exhibit superadditivity. In this paper we show that a unitary chosen uniformly at random from an approximate $n^{2/3}$-design gives rise to a quantum channel with superadditive classical Holevo capacity, where $n$ is the dimension of the unitary exhibiting the Stinespring dilation of the channel superoperator. We prove a sharp Dvoretzky-like theorem (similar to Aubrun, Szarek, Werner, 2010) stating that, with high probability under the choice of a unitary from an approximate $t$-design, random subspaces of large dimension make a Lipschitz function take almost constant value. Such theorems were known earlier only for Haar random unitaries. We obtain our result by appealing to Low's technique for proving concentration of measure for an approximate $t$-design, combined with a stratified analysis of the variational behaviour of Lipschitz functions on the unit sphere in high dimension. The stratified analysis is the main technical advance of this work. Finally we also show that for any $p>1$, approximate unitary $(n^{1.7} \log n)$-designs give rise to channels violating subadditivity of Rényi $p$-entropy. In addition to stratified analysis, the proof of this result uses a new technique of approximating a monotonic differentiable function defined on a closed bounded interval and its derivative by moderate degree polynomials which should be of independent interest. Hence, our work can be viewed as a partial derandomisation of Hastings' result and a step towards the quest of finding an explicit quantum channel with superadditive classical Holevo capacity.

arXiv:1902.10808•Leibniz international proceedings in informatics•Jan 1, 2019•3 citations

Yet another additivity conjecture

Keiji Matsumoto

arXiv:quant-ph/0506052•Physics Letters A•Oct 18, 2005•7 citations

Entanglement of random subspaces via the Hastings bound

Motohisa Fukuda, Christopher King

Recently, Hastings [“A counterexample to additivity of minimum output entropy,” Nat. Phys. 5, 255 (2009); e-print arXiv:0809.3972v3] proved the existence of random unitary channels, which violate the additivity conjecture. In this paper, we use Hastings’ method to derive new bounds for the entanglement of random subspaces of bipartite systems. As an application we use these bounds to prove the existence of nonunital channels, which violate additivity of minimal output entropy.

arXiv:0907.5446•Journal of Mathematical Physics•Apr 1, 2010•24 citations

Generalization of Maeda's theorem

Anatolij Dvurečenskij

International Journal of Theoretical Physics•Oct 1, 1986•9 citations
In a breakthrough, Hastings' showed that there exist quantum channels whose classical capacity is superadditive i.e. more classical information can be transmitted by quantum encoding strategies entangled across multiple channel uses as compared to unentangled quantum encoding strategies. Hastings' proof used Haar random unitaries to exhibit superadditivity. In this paper we show that a unitary chosen uniformly at random from an approximate n2/3n^{2/3}n2/3-design gives rise to a quantum channel with superadditive classical Holevo capacity, where nnn is the dimension of the unitary exhibiting the Stinespring dilation of the channel superoperator. We prove a sharp Dvoretzky-like theorem (similar to Aubrun, Szarek, Werner, 2010) stating that, with high probability under the choice of a unitary from an approximate ttt-design, random subspaces of large dimension make a Lipschitz function take almost constant value. Such theorems were known earlier only for Haar random unitaries. We obtain our result by appealing to Low's technique for proving concentration of measure for an approximate ttt-design, combined with a stratified analysis of the variational behaviour of Lipschitz functions on the unit sphere in high dimension. The stratified analysis is the main technical advance of this work. Finally we also show that for any p>1p>1p>1, approximate unitary (n1.7log⁡n)(n^{1.7} \log n)(n1.7logn)-designs give rise to channels violating subadditivity of Rényi ppp-entropy. In addition to stratified analysis, the proof of this result uses a new technique of approximating a monotonic differentiable function defined on a closed bounded interval and its derivative by moderate degree polynomials which should be of independent interest. Hence, our work can be viewed as a partial derandomisation of Hastings' result and a step towards the quest of finding an explicit quantum channel with superadditive classical Holevo capacity.