pith. sign in

arxiv: 0807.4753 · v1 · pith:CRH7LYLHnew · submitted 2008-07-30 · 🪐 quant-ph · cs.IT· math-ph· math.IT· math.MP

Counterexamples to the maximal p-norm multiplicativity conjecture for all p > 1

classification 🪐 quant-ph cs.ITmath-phmath.ITmath.MP
keywords entropyoutputcounterexamplesmaximalminimumquantumchannelchannels
0
0 comments X
read the original abstract

For all p > 1, we demonstrate the existence of quantum channels with non-multiplicative maximal output p-norms. Equivalently, for all p >1, the minimum output Renyi entropy of order p of a quantum channel is not additive. The violations found are large; in all cases, the minimum output Renyi entropy of order p for a product channel need not be significantly greater than the minimum output entropy of its individual factors. Since p=1 corresponds to the von Neumann entropy, these counterexamples demonstrate that if the additivity conjecture of quantum information theory is true, it cannot be proved as a consequence of any channel-independent guarantee of maximal p-norm multiplicativity. We also show that a class of channels previously studied in the context of approximate encryption lead to counterexamples for all p > 2.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.