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:1305.1567 · Communications in Mathematical Physics

Almost One Bit Violation for the Additivity of the Minimum Output Entropy

Serban T. Belinschi, Benoı̂t Collins, Ion Nechita

Published Jan 11, 2016• 29 citations
arXivHTMLPDF
DOI
10.1007/s00220-015-2561-z

Related papers

Counterexamples to Additivity of Minimum Output p-Renyi Entropy for p Close to 0

Toby S. Cubitt, Harrow, AW, Debbie Leung +2 more

•Nov 1, 2008•31 citations

Counterexamples to Additivity of Minimum Output p-Rényi Entropy for p Close to 0

Toby S. Cubitt, Aram W. Harrow, Debbie Leung +2 more

arXiv:0712.3628•Communications in Mathematical Physics•Sep 9, 2008•43 citations

The minimum Rényi entropy output of a quantum channel is locally additive

Gilad Gour, Todd Kemp

arXiv:1601.00982•Letters in Mathematical Physics•Dec 10, 2016•2 citations

A counterexample to additivity of minimum output entropy

Matthew B. Hastings

We present a random construction of a pairs of channels which gives, with non-zero probability for sufficiently large dimensions, a counterexample to the minimum output entropy conjecture.As is known [4], this implies a violation of the additivity conjecture for the classical capacity of quantum channels.Thc violation of the minimum output cntropy conjecture is relatively small.

Physical Review Letters•Jan 1, 2008•21 citations

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.

quant-pharXiv:2607.15210•Jul 17, 2026•0 citations

Haagerup's inequality and additivity violation of the Minimum Output Entropy

Benoı̂t Collins

We give a simple and conceptual proof of the fact that random unitary channels yield violation of the Minimum Output Entropy additivity. The proof relies on strong convergence of random unitary matrices and Haagerup's inequality.

arXiv:1603.00577•Mar 2, 2016•6 citations
Counterexamples to additivity of minimum output ppp-Rényi entropy of quantum channels for all p≥0p\ge 0p≥0
The additivity of minimum output entropies is a central problem in quantum information theory. Nonadditivity is known for every Rényi order p>1p>1p>1, at the von Neumann point p=1p=1p=1, and for sufficiently small positive ppp, while much of the interval 0<p<10<p<10<p<1 has remained open. In this work, we prove that for every p>0p>0p>0 there exist finite-dimensional quantum channels whose minimum output ppp-Rényi entropies violate additivity. Our proof combines two constructions: random projection-induced channels yield nonadditivity for p>3/4p>3/4p>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.