2000 character limit reached
Constructive counterexamples to the additivity of minimum output Rényi entropy of quantum channels for all $p>1$
Published 8 Oct 2025 in quant-ph | (2510.07547v1)
Abstract: We present explicit quantum channels with strictly sub-additive minimum output R\'enyi entropy for all $p>1$, improving upon prior constructions which handled $p>2$. Our example is provided by explicit constructions of linear subspaces with high geometric measure of entanglement. This construction applies in both the bipartite and multipartite settings. As further applications, we use our construction to find entanglement witnesses with many highly negative eigenvalues, and to construct entangled mixed states that remain entangled after perturbation.
Paper Prompts
Sign up for free to create and run prompts on this paper.