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 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 investigate decoherence induced by a quantum channel in terms of minimal output entropy and map entropy. The latter is the von Neumann entropy of the Jamiołkowski 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 Φ1acting on a finite dimensional system, there exists a class of channels Φ2sufficiently close to a unitary map such that additivity of minimal output entropy for Ψ1⊗ Ψ2holds.
We consider the minimal entropy of qubit states transmitted through two uses of a noisy quantum channel, which is modeled by the action of a completely positive trace-preserving (or stochastic) map. We provide strong support for the conjecture that this minimal entropy is additive, namely, that the minimum entropy can be achieved when product states are transmitted. Explicitly, we prove that for a tensor product of two unital stochastic maps on qubit states, using an entanglement that involves only states which emerge with minimal entropy cannot decrease the entropy below the minimum achievable using product states. We give a separate argument, based on the geometry of the image of the set of density matrices under stochastic maps, which suggests that the minimal entropy conjecture holds for nonunital as well as for unital maps. We also show that the maximal norm of the output states is multiplicative for most product maps on n-qubit states, including all those for which at least one map is unital. For the class of unital channels on C/sup 2/, we show that additivity of minimal entropy implies that the Holevo (see IEEE Trans. Inform. Theory, vol.44, p.269-73, 1998 and Russian Math. Surv., p.1295-1331, 1999) capacity of the channel is additive over two inputs, achievable with orthogonal states, and equal to the Shannon capacity. This implies that superadditivity of the capacity is possible only for nonunital channels.
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.
Abstract The stability theorem of the depolarizing channel states that if a state is close to achieving the minimal/maximal output value of a certain quantity through the channel, then it must be close to an input state giving the minimal/maximal value. We show that the stability theorem of the depolarizing channel holds for the output quantum p -Rényi entropy for or p = 1, which is an extension of the known case p = 2. As an application, we present a protocol in which Bob determines whether Alice prepares a pure quantum state close to a product state. In the protocol, Alice transmits to Bob multiple copies of a pure state through a depolarizing channel, and Bob estimates its output quantum p -Rényi entropy. By using our stability theorem, we show that Bob can determine whether her preparation is appropriate.
Counterexamples to additivity of minimum output p-Rényi entropy of quantum channels for all p≥0
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.
In this work, we study two different approaches to defining the entropy of a quantum channel. One of these is based on the von Neumann entropy of the corresponding Choi-Jamiołkowski state. The second one is based on the relative entropy of the output of the extended channel relative to the output of the extended completely depolarizing channel. This entropy then needs to be optimized over all possible input states. Our results first show that the former entropy provides an upper bound on the latter. Next, we show that for unital qubit channels, this bound is saturated. Finally, we conjecture and provide numerical intuitions that the bound can also be saturated for random channels as their dimension tends to infinity.