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.
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 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.
The information-carrying capacity of the d-dimensional depolarizing channel is computed. It is shown that this capacity can be achieved by encoding messages as products of pure states belonging to an orthonormal basis of the state space, and using measurements which are products of projections onto this same orthonormal basis. In other words, neither entangled signal states nor entangled measurements give any advantage for information capacity. The result follows from an additivity theorem for the product channel /spl Delta//spl ominus//spl Psi/, where /spl Delta/ is the depolarizing channel and /spl Psi/ is a completely arbitrary channel. We establish the Amosov-Holevo-Werner(see Probl. Inform. Transm., vol.36, p.305-313, 2000) p-norm conjecture for this product channel for all p/spl ges/1, and deduce from this the additivity of the minimal entropy and of the Holevo quantity /spl chi//sup */.
A central challenge in quantum information theory is to determine whether entanglement provides an advantage for information processing when coherent operations across multiple channel uses are allowed. For depolarizing channels, King's proof of the additivity of the minimum output entropy rules out such an advantage for classical communication at leading asymptotic order, while leaving open the possibility of an advantage for higher orders. In this work, we conjecture a majorization relation for the outputs of depolarizing channels and prove an approximate version of this conjecture. Our proof combines an exact ordering of shifted log-determinants with an anti-concentration bound for the spectrum of the product-state output, refining King's analysis based on Schatten norms. As a direct application, we obtain a tight third-order expansion for the classical capacity of quantum depolarizing channels. Consequently, entangled codewords and collective decoding can improve the message size over the product-coding strategy by at most
O(loglogn) bits, sharpening our understanding of the role of entanglement in the finite-blocklength regime.
Quantum channels can be described via a unitary coupling of system and environment, followed by a trace over the environment state space. Taking the trace instead over the system state space produces a different mapping which we call the conjugate channel. We explore the properties of conjugate channels and describe several different methods of construction. In general, conjugate channels map M_d to M_d' with d < d', and different constructions may differ by conjugation with a partial isometry. We show that a channel and its conjugate have the same minimal output entropy and maximal output p-norm. It then follows that the additivity and multiplicativity conjectures for these measures of optimal output purity hold for a product of channels if and only if they also hold for the product of their conjugates. This allows us to reduce these conjectures to the special case of maps taking M_d to M_d' with a minimal representation of dimension at most d. We find explicit expressions for the conjugates for a number of well-known examples, including entanglement-breaking channels, unital qubit channels, the depolarizing channel, and a subclass of random unitary channels. For the entanglement-breaking channels, channels this yields a new class of channels for which additivity and multiplicativity of optimal output purity can be established. For random unitary channels using the generalized Pauli matrices, we obtain a new formulation of the multiplicativity conjecture. The conjugate of the completely noisy channel plays a special role and suggests a mechanism for using noise to transmit information.