We prove additivity violation of minimum output entropy of quantum channels by straightforward application of ε-net argument and Lévy's lemma. The additivity conjecture was disproved initially by Hastings. Later, a proof via asymptotic geometric analysis was presented by Aubrun, Szarek and Werner, which uses Dudley's bound on Gaussian process (or Dvoretzky's theorem with Schechtman's improvement). In this paper, we develop another proof along Dvoretzky's theorem in Milman's view showing additivity violation in broader regimes than the existing proofs. Importantly, Dvoretzky's theorem works well with norms to give strong statements but these techniques can be extended to functions which have norm-like structures - positive homogeneity and triangle inequality. Then, a connection between Hastings' method and ours is also discussed. Besides, we make some comments on relations between regularized minimum output entropy and classical capacity of quantum channels.We prove additivity violation of minimum output entropy of quantum channels by straightforward application of ε-net argument and Lévy's lemma. The additivity conjecture was disproved initially by Hastings. Later, a proof via asymptotic geometric analysis was presented by Aubrun, Szarek and Werner, which uses Dudley's bound on Gaussian process (or Dvoretzky's theorem with Schechtman's improvement). In this paper, we develop another proof along Dvoretzky's theorem in Milman's view showing additivity violation in broader regimes than the existing proofs. Importantly, Dvoretzky's theorem works well with norms to give strong statements but these techniques can be extended to functions which have norm-like structures - positive homogeneity and triangle inequality. Then, a connection between Hastings' method and ours is also discussed. Besides, we make some comments on relations between regularized minimum output entropy and classical capacity of quantum channels.

Jan 1, 201415 citations

Simplification of Additivity Conjecture in Quantum Information Theory

Motohisa Fukuda

arXiv:quant-ph/0608010Quantum Information ProcessingMar 14, 200722 citations

On Hastings' Counterexamples to the Minimum Output Entropy Additivity Conjecture

Fernando G. S. L. Brandão, Michał Horodecki

Hastings recently reported a randomized construction of channels violating the minimum output entropy additivity conjecture. Here we revisit his argument, presenting a simplified proof. In particular, we do not resort to the exact probability distribution of the Schmidt coefficients of a random bipartite pure state, as in the original proof, but rather derive the necessary large deviation bounds by a concentration of measure argument. Furthermore, we prove non-additivity for the overwhelming majority of channels consisting of a Haar random isometry followed by partial trace over the environment, for an environment dimension much bigger than the output dimension. This makes Hastings' original reasoning clearer and extends the class of channels for which additivity can be shown to be violated.Hastings recently reported a randomized construction of channels violating the minimum output entropy additivity conjecture. Here we revisit his argument, presenting a simplified proof. In particular, we do not resort to the exact probability distribution of the Schmidt coefficients of a random bipartite pure state, as in the original proof, but rather derive the necessary large deviation bounds by a concentration of measure argument. Furthermore, we prove non-additivity for the overwhelming majority of channels consisting of a Haar random isometry followed by partial trace over the environment, for an environment dimension much bigger than the output dimension. This makes Hastings' original reasoning clearer and extends the class of channels for which additivity can be shown to be violated.

arXiv:0907.3210Open Systems & Information DynamicsMar 1, 201060 citations

A linearization of quantum channels

Tanner Crowder

Journal of Geometry and PhysicsFeb 24, 20159 citations

Counterexamples to additivity of minimum output $p$ -Rényi entropy of quantum channels for all $p\ge 0$ Counterexamples to additivity of minimum output $p$-Rényi entropy of quantum channels for all $p\ge 0$

Debbie Leung, Benjamin Lovitz, Ion Nechita +1 more

The additivity of minimum output entropies is a central problem in quantum information theory. Nonadditivity is known for every Rényi order $p>1$ , at the von Neumann point $p=1$ , and for sufficiently small positive $p$ , while much of the interval $0<p<1$ has remained open. In this work, we prove that for every $p>0$ there exist finite-dimensional quantum channels whose minimum output $p$ -Rényi entropies violate additivity. Our proof combines two constructions: random projection-induced channels yield nonadditivity for $p>3/4$ , and antisymmetric postprocessing extends the violation to all positive Rényi orders. Our estimates also improve the output-dimension bound obtained by Belinschi, Collins, and Nechita for additivity violation of minimum output von Neumann entropy.The additivity of minimum output entropies is a central problem in quantum information theory. Nonadditivity is known for every Rényi order $p>1$, at the von Neumann point $p=1$, and for sufficiently small positive $p$, while much of the interval $0<p<1$ has remained open. In this work, we prove that for every $p>0$ there exist finite-dimensional quantum channels whose minimum output $p$-Rényi entropies violate additivity. Our proof combines two constructions: random projection-induced channels yield nonadditivity for $p>3/4$, and antisymmetric postprocessing extends the violation to all positive Rényi orders. Our estimates also improve the output-dimension bound obtained by Belinschi, Collins, and Nechita for additivity violation of minimum output von Neumann entropy.

quant-pharXiv:2607.15210Jul 17, 20260 citations

Superadditivity of classical capacity revisited

Oleg V. Pilyavets, Evgueni Karpov, Joachim Schäfer

We introduce new type of superadditivity for classical capacity of quantum channels, which involves the properties of channels' environment.By imposing different restrictions on the total energy contained in channels' environment we can consider different types of superadditivity.Using lossy bosonic and additive noise quantum channels as examples, we demonstrate that their capacities can be either additive or superadditive depending on the values of channels parameters.The parameters corresponding to transition between the additive and superadditive cases are related with recently found critical and supercritical parameters for Gaussian channels.We introduce new type of superadditivity for classical capacity of quantum channels, which involves the properties of channels' environment.By imposing different restrictions on the total energy contained in channels' environment we can consider different types of superadditivity.Using lossy bosonic and additive noise quantum channels as examples, we demonstrate that their capacities can be either additive or superadditive depending on the values of channels parameters.The parameters corresponding to transition between the additive and superadditive cases are related with recently found critical and supercritical parameters for Gaussian channels.

AIP conference proceedingsJan 1, 20141 citation

Counterexamples to additivity of minimum output

p

-Rényi entropy of quantum channels for all

p\ge 0

The additivity of minimum output entropies is a central problem in quantum information theory. Nonadditivity is known for every Rényi order

p>1

, at the von Neumann point

p=1

, and for sufficiently small positive

p

, while much of the interval

0<p<1

has remained open. In this work, we prove that for every

p>0

there exist finite-dimensional quantum channels whose minimum output

p

-Rényi entropies violate additivity. Our proof combines two constructions: random projection-induced channels yield nonadditivity for

p>3/4

, and antisymmetric postprocessing extends the violation to all positive Rényi orders. Our estimates also improve the output-dimension bound obtained by Belinschi, Collins, and Nechita for additivity violation of minimum output von Neumann entropy.