相关论文: Qubit Channels Which Require Four Inputs to Achiev…

We consider a nontrivial class of infinite dimensional quantum channels characterized by finiteness of the Holevo capacity. Some general properties of channels of this class are described. In particular, a special sufficient condition of…

This article provides an elementary introduction to Gaussian channels and their capacities. We review results on the classical, quantum, and entanglement assisted capacities and discuss related entropic quantities as well as additivity…

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,…

The entropy H_T(rho) of a state rho with respect to a channel T and the Holevo capacity of the channel require the solution of difficult variational problems. For a class of 1-qubit channels, which contains all the extremal ones, the…

We study quantum channels that are close to another channel with weakly additive Holevo information and derive upper bounds on their classical capacity. Examples of channels with weakly additive Holevo information are entanglement-breaking…

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…

The capacity of a quantum channel for transmission of classical information depends in principle on whether product states or entangled states are used at the input, and whether product or entangled measurements are used at the output. We…

We describe analytical properties of the average output entropy of a quantum channel as a function of a pair (channel, input ensemble). In particular, tight semicontinuity bounds for this function with the rank/energy constraints are…

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…

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 quantum capacity of a pure quantum channel and that of classical-quantum-classical channel are discussed in detail based on the fully quantum mechanical mutual entropy. It is proved that the quantum capacity generalizes the so-called…

Quantum communication holds the potential to revolutionize information transmission by enabling secure data exchange that exceeds the limits of classical systems. One of the key performance metrics in quantum information theory, namely the…

Some new examples of quantum channels for which the infimum of the output entropy is additive under taking a tensor product of channels are given.

We study a natural generalization of the additivity problem in quantum information theory: given a pair of quantum channels, then what is the set of convex trace functions that attain their maximum on unentangled inputs, if they are applied…

The purpose of these notes is to discuss the relation between the additivity questions regarding the quantities (Holevo) capacity of a quantum channel T and entanglement of formation of a given bipartite state. In particular, using the…

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…

The minimum entropy output is computed for rotationally invariant quantum channels acting on spin-1/2 and spin-1 systems. For the case of two parallel such channels and initial entangled (singlet) state the entropy of the output is higher…

Evaluating the channel capacity is one of many key problems in information theory. In this work we derive rather-mild sufficient conditions under which the capacity is finite and achievable. These conditions are derived for generic,…

We propose an iterative method for approximating the capacity of classical-quantum channels with a discrete input alphabet and a finite dimensional output, possibly under additional constraints on the input distribution. Based on duality of…

We introduce a condition for memoryless quantum channels which, when satisfied guarantees the multiplicativity of the maximal l_p-norm with p a fixed integer. By applying the condition to qubit channels, it can be shown that it is not a…