Inspired by Montanaro’s work, we introduce the concept of additivity rates of a quantum channel L , which give the first order (linear) term of the minimum output p -Rényi entropies of L ⊗ r as functions of r . We lower bound the additivity rates of arbitrary quantum channels using the operator norms of several interesting matrices including partially transposed Choi matrices. As a direct consequence, we obtain upper bounds for the classical capacity of the channels. We study these matrices for random quantum channels defined by random subspaces of a bipartite tensor product space. A detailed spectral analysis of the relevant random matrix models is performed, and strong convergence towards free probabilistic limits is shown. As a corollary, we compute the threshold for random quantum channels to have the positive partial transpose (PPT) property. We then show that a class of random PPT channels violate generically additivity of the p -Rényi entropy for all p ≥ 30 . 95 .
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.
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.
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 study of entanglement inevitably leads to the concept of regularization, where measures are evaluated on infinitely many copies of a state. Single-letter formulas try to make these asymptotic entanglement quantities accessible through a calculation on one copy of a state, but are rarely available. We introduce a decreasing hierarchy of computable upper bounds on the asymptotic relative entropy of entanglement with respect to positive-partial-transpose (PPT) states. The regularization of every fixed hierarchy level equals this asymptotic quantity. Additivity at any level therefore yields a single-letter formula, even when the usual one-copy relative entropy is nonadditive. We establish such additivity at the first nontrivial level for two broad multiparameter families, both containing all Werner states. The upper-bound construction also extends to sandwiched Renyi divergences. The hierarchy motivates
k-multinegative states, a generalization of binegative states and the associated
k-multinegativity, which gives explicit upper bounds on both the asymptotic relative entropy and exact PPT entanglement cost. We construct states which are
k-multinegative at arbitrarily large depths
k that separate consecutive levels of the previously introduced entanglement-cost hierarchy, disproving its conjectured finite collapse. These results provide state-dependent single-letter formulas while identifying a limitation of universal finite-level characterizations.