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:1601.00982 · Letters in Mathematical Physics

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

Gilad Gour, Todd Kemp

Published Dec 10, 2016• 3 citations
arXivHTMLPDF
DOI
10.1007/s11005-016-0933-8

Related papers

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•56 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•8 citations

Random quantum channels II: Entanglement of random subspaces, Rényi entropy estimates and additivity problems

Benoît Collins, Ion Nechita

arXiv:0906.1877•Advances in Mathematics•Aug 22, 2010•38 citations

On two classes of Rényi entropy functions of a quantum channel

Yanjun Chu, Fang Huang, Zhu‐Jun Zheng

The European Physical Journal Plus•Sep 18, 2024•2 citations

New Constructive Counterexamples to Additivity of Minimum Output Rényi p-Entropy of Quantum Channels

Krzysztof Szczygielski, Michał Studziński

In this paper, we present new families of quantum channels for which corresponding minimum output Rényi p-entropy is not additive. Our manuscript is motivated by the results of Grudka et al. and we focus on channels characterized by both extensions and subspaces of the antisymmetric subspace in$\mathbb {C}^{d} \otimes \mathbb {C} ^{d}$, which exhibit additivity breaking for$p\gt 2$.

arXiv:2301.07428•IEEE Transactions on Information Theory•Aug 19, 2024•3 citations

On S-mixing entropy of quantum channels

Farrukh Maksutovich Mukhamedov, Noboru Watanabe

Quantum Information Processing•May 10, 2018•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.
In this paper, we present new families of quantum channels for which corresponding minimum output Rényi p-entropy is not additive. Our manuscript is motivated by the results of Grudka et al. and we focus on channels characterized by both extensions and subspaces of the antisymmetric subspace inCd⊗Cd\mathbb {C}^{d} \otimes \mathbb {C} ^{d}Cd⊗Cd, which exhibit additivity breaking forp>2p\gt 2p>2.