For all 1 < p < 2, we demonstrate the existence of quantum channels with non-multiplicative maximal p-norms. Equivalently, the minimum output Renyi entropy of order p of a quantum channel is not additive for all 1 < p < 2. The violations found are large. As p approaches 1, 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 maximal p-norm multiplicativity.
We consider the additivity of the minimal output entropy and the classical information capacity of a class of quantum channels. For this class of channels, the norm of the output is maximized for the output being a normalized projection. We prove the additivity of the minimal output Renyi entropies with entropic parameters α ∊ [0, 2], generalizing an argument by Alicki and Fannes, and present a number of examples in detail. In order to relate these results to the classical information capacity, we introduce a weak form of covariance of a channel. We then identify various instances of weakly covariant channels for which we can infer the additivity of the classical information capacity. Both additivity results apply to the case of an arbitrary number of different channels. Finally, we relate the obtained results to instances of bi-partite quantum states for which the entanglement cost can be calculated.
We investigate decoherence induced by a quantum channel in terms of minimal output entropy and of map entropy. The latter is the von Neumann entropy of the Jamiolkowski state of the channel. Both quantities admit q-Renyi versions. We prove additivity of the map entropy for all q. For the case q = 2, we show that the depolarizing channel has the smallest map entropy among all channels with a given minimal output Renyi entropy of order two. This allows us to characterize pairs of channels such that the output entropy of their tensor product acting on a maximally entangled input state is larger than the sum of the minimal output entropies of the individual channels. We conjecture that for any channel Φ1 acting on a finite dimensional system there exists a class of channels Φ2 sufficiently close to a unitary map such that additivity of minimal output entropy for Ψ1 x Ψ2 holds.
We reformulate the Rényi entanglement of purification as a constrained minimum output Rényi entropy problem. Equivalently, for
p>1, this formulation can be expressed in terms of a constrained maximal output Schatten
p-norm. More precisely, for a completely positive map
Ω:L(B′)→L(A), we consider the quantity
υp(Ω) defined by optimizing
∥(Ω⊗idE)(σB′E)∥p over all bipartite states
σB′E whose
B′-marginal is maximally mixed. We focus on the case
p=2. First, we compute
υ2 for the transpose-depolarizing channel and prove that it is multiplicative under tensor powers. We then establish a general multiplicativity criterion: whenever a completely positive map
N:L(B′)→L(A) satisfies
N†∘N=aidA+bTr[⋅]Id for some constants
a,b≥0, where
N† denotes the Hilbert-Schmidt adjoint of
N, the quantity
υ2(N) is multiplicative under tensor powers. Examples of channels satisfying this criterion include the transpose-depolarizing channel, the depolarizing channel, and their respective complementary channels. Furthermore, we show that, for every completely positive map
Ω, multiplicativity of
υp(Ω) implies multiplicativity for its complementary map. This yields the corresponding additivity statements for the associated Rényi-2 entanglement of purification.
We consider the additivity of the minimal output entropy and the classical information capacity of a class of quantum channels. This class is the one for which the norm of the output is maximized for an output state being a normalized projection. For such channels - which we characterize in their general form - we prove the additivity of the minimal output Renyi entropies with entropic parameters contained in [0, 2], generalizing an argument by Alicki and Fannes, and present several examples in detail. In order to relate these results to the classical information capacity, we introduce a weak form of covariance of a channel. We then identify instances of weakly covariant channels for which we can infer the additivity of the classical information capacity. Both additivity results apply to the case of an arbitrary number of different channels. Finally, we relate the obtained results to instances of bi-partite quantum states for which the entanglement cost can be calculated.