Related papers: The maximal p-norm multiplicativity conjecture is …
Hastings recently reported a randomized construction of channels violating the minimum output entropy additivity conjecture. Here we revisit his argument, presenting a simplified proof. In particular, we do not resort to the exact…
Capacities of quantum channels are fundamental quantities in the theory of quantum information. A desirable property is the additivity for a capacity. However, this cannot be achieved for a few quantities that have been established as…
We prove that the minimal Renyi entropy of order 2 (RE2) output of a positive-partial-transpose(PPT)-inducing channel joint to an arbitrary other channel is equal to the sum of the minimal RE2 output of the individual channels. PPT-inducing…
Additivity of minimal entropy output is proven for the class of quantum channels $\Lambda_t (A):=t A^{T}+(1-t)\tau (A)$ in the parameter range $-2/(d^2-2)\le t \le 1/(d+1)$.
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{\l}kowski state. The second one is based on the relative entropy…
The Amosov-Holevo-Werner conjecture implies the additivity of the minimum Re'nyi entropies at the output of a channel. The conjecture is proven true for all Re'nyi entropies of integer order greater than two in a class of Gaussian bosonic…
In this paper, 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…
We show that under a certain condition of local commutativity the minimum von-Neumann entropy output of a quantum channel is locally additive. We also show that local minima of the 2-norm entropy functions are closed under tensor products…
The Renyi entropies constitute a family of information measures that generalizes the well-known Shannon entropy, inheriting many of its properties. They appear in the form of unconditional and conditional entropies, relative entropies or…
We prove the quantum conditional Entropy Power Inequality for quantum additive noise channels. This inequality lower bounds the quantum conditional entropy of the output of an additive noise channel in terms of the quantum conditional…
Quantum channels represent a broad spectrum of operations crucial to quantum information theory, encompassing everything from the transmission of quantum information to the manipulation of various resources. In the domain of states, the…
It shown that when one of the components of a product channel is entanglement breaking, the output state with maximal p-norm is always a product state. This result complements Shor's theorem that both minimal entropy and Holevo capacity are…
We analyze the quantum capacity of a unital quantum channel, using ideas from the proof of near-optimality of Petz recovery map [Barnum and Knill 2000] and give an upper bound on the quantum capacity in terms of regularized output $2$-norm…
We show that for the tensor product of an entanglement-breaking quantum channel with an arbitrary quantum channel, both the minimum entropy of an output of the channel and the Holevo-Schumacher-Westmoreland capacity are additive. In…
We argue that a fundamental (conjectured) property of memoryless quantum channels, namely the strong superadditivity, is intimately related to the decreasing property of the quantum relative entropy. Using the latter we first give, for a…
The design of error-correcting codes used in modern communications relies on information theory to quantify the capacity of a noisy channel to send information [1]. This capacity can be expressed using the mutual information between input…
We investigate minimum output (R\'enyi) entropy of qubit channels and unital quantum channels. We obtain an exact formula for the minimum output entropy of qubit channels, and bounds for unital quantum channels. Interestingly, our bounds…
Determining capacities of quantum channels is a fundamental question in quantum information theory. Despite having rigorous coding theorems quantifying the flow of information across quantum channels, their capacities are poorly understood…
It is now well-known that, with high probability, the additivity of minimum output entropy does not hold for a pair of a random quantum channel and its complex conjugate. We investigate asymptotic behavior of output states of $r$-tensor…
We give a simple and conceptual proof of the fact that random unitary channels yield violation of the Minimum Output Entropy additivity. The proof relies on strong convergence of random unitary matrices and Haagerup's inequality.