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

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

Camilo Arturo Zapata Ocampo

Published Jan 1, 2014• 0 citations
OpenAlex

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

Hastings’s Additivity Counterexample via Dvoretzky’s Theorem

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

arXiv:1003.4925•Communications in Mathematical Physics•Nov 25, 2010•92 citations

The Holevo Capacity of Infinite Dimensional Channels and the Additivity Problem

Максим Евгеньевич Широков

arXiv:quant-ph/0408009•Communications in Mathematical Physics•Oct 28, 2005•55 citations

Remarks on Additivity of the Holevo Channel Capacity and of the Entanglement of Formation

Keiji Matsumoto, Toshiyuki Shimono, Andreas Winter

arXiv:quant-ph/0206148•Communications in Mathematical Physics•Apr 1, 2004•85 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

Approximate Unitary Designs Give Rise to Quantum Channels With Super Additive Classical Holevo Capacity

Aditya Nema, Pranab Sen

In a breakthrough, Hastings showed that there exist quantum channels whose classical Holevo 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 follow the geometric functional analytic approach of Aubrun, Szarek and Werner in order to prove our result. More precisely we prove a sharp Dvoretzky-like theorem 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. Haar random unitaries require at least$\Omega (n^{2})$random bits in order to describe them with good precision. In contrast, there exist exact$n^{2/3}$-designs using only$O(n^{2/3} \log n)$random bits. Thus, 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. Finally we also show that for any$p > 1$, approximate unitary$n^{1.7}$-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.

IEEE Transactions on Information Theory•Apr 21, 2022•1 citation
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.
In a breakthrough, Hastings showed that there exist quantum channels whose classical Holevo 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 approximaten2/3n^{2/3}n2/3-design gives rise to a quantum channel with superadditive classical Holevo capacity, wherennnis the dimension of the unitary exhibiting the Stinespring dilation of the channel superoperator. We follow the geometric functional analytic approach of Aubrun, Szarek and Werner in order to prove our result. More precisely we prove a sharp Dvoretzky-like theorem stating that, with high probability under the choice of a unitary from an approximatettt-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 approximatettt-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. Haar random unitaries require at leastΩ(n2)\Omega (n^{2})Ω(n2)random bits in order to describe them with good precision. In contrast, there exist exactn2/3n^{2/3}n2/3-designs using onlyO(n2/3log⁡n)O(n^{2/3} \log n)O(n2/3logn)random bits. Thus, 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. Finally we also show that for anyp>1p > 1p>1, approximate unitaryn1.7n^{1.7}n1.7-designs give rise to channels violating subadditivity of Rényippp-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.