We investigate information theoretic properties of low rank (less than or equal to 3) quantum channels with [Formula: see text]-symmetry, where we have a complete description. We prove that PPT property coincides with entanglement-breaking property and that degradability seldomly holds in this class. In connection with these results, we will demonstrate how we can compute Holevo and coherent information of those channels. In particular, we exhibit a strong form of additivity violation of coherent information, which resembles the superactivation of coherent information of depolarizing channels.
We investigate information theoretic properties of low rank (less than or equal to 3) quantum channels with [Formula: see text]-symmetry, where we have a complete description. We prove that PPT property coincides with entanglement-breaking property and that degradability seldomly holds in this class. In connection with these results, we will demonstrate how we can compute Holevo and coherent information of those channels. In particular, we exhibit a strong form of additivity violation of coherent information, which resembles the superactivation of coherent information of depolarizing channels.
In this thesis, we introduce EPOSIC channels, a class of SU(2) -covariant quantum channels. For each of them, we give a Stinespring representation, a Kraus representation, its Choi matrix, a complementary channel, and its dual map. We show that these channels are the extreme points of all SU(2) -irreducibly covariant channels. As an application of these channels to the theory of quantum information, we study the minimal output entropy of EPOSIC channels, and show that a large class of these channels is a potential example of violating the well-known problem, the additivity problem. We determine the cases where their minimal output entropy is not zero, and obtain some partial results on the fulfillment of their entanglement breaking property. We find a bound of the minimal output entropy of the tensor product of two SU(2) -irreducibly covariant channels. We also get an example of a positive map that is not completely positive.
In quantum information theory, there are few quantum channels whose specific formulas and properties are known.In this thesis, we introduce EPOSIC channels, a class of SU(2)-irreducibly covariant quantum channels, and compute their χ-capacity and entropy in some cases.We review the basics of group representation theory and quantum information theory, and we construct EPOSIC channels, a new class of quantum channels, using representation theory.We also study specific formulas and properties of EPOSIC channels.
We study quantum channels that are close to another channel with weakly additive Holevo information, and we derive upper bounds on their classical capacity. Examples of channels with weakly additive Holevo information are entanglement-breaking channels, unital qubit channels, and Hadamard channels. Related to the method of approximate degradability, we define approximation parameters for each class above, which measure how close an arbitrary channel is to satisfying the respective property. This gives us upper bounds on the classical capacity in terms of functions of the approximation parameters, as well as an outer bound on the dynamic capacity region of a quantum channel. Since these parameters are defined in terms of the diamond distance, the upper bounds can be computed efficiently using semidefinite programming (SDP). We exhibit the usefulness of our method with two example channels: a convex mixture of amplitude damping and depolarizing noise and a composition of amplitude damping and dephasing noise. For both channels, our bounds perform well in certain regimes of the noise parameters in comparison to a recently derived SDP upper bound on the classical capacity. Along the way, we define the notion of a generalized channel divergence (which includes the diamond distance as an example), and we prove that for jointly covariant channels these quantities are maximized by purifications of a state invariant under the covariance group. This latter result may be of independent interest.
Degradable quantum channels are among the only channels whose quantum and private classical capacities are known. As such, determining the structure of these channels is a pressing open question in quantum information theory. We give a comprehensive review of what is currently known about the structure of degradable quantum channels, including a number of new results as well as alternate proofs of some known results. In the case of qubits, we provide a complete characterization of all degradable channels with two dimensional output, give a new proof that a qubit channel with two Kraus operators is either degradable or anti-degradable, and present a complete description of anti-degradable unital qubit channels with a new proof. For higher output dimensions we explore the relationship between the output and environment dimensions (dB and dE, respectively) of degradable channels. For several broad classes of channels we show that they can be modeled with an environment that is “small” in the sense of ΦC. Such channels include all those with qubit or qutrit output, those that map some pure state to an output with full rank, and all those which can be represented using simultaneously diagonal Kraus operators, even in a non-orthogonal basis. Perhaps surprisingly, we also present examples of degradable channels with “large” environments, in the sense that the minimal dimension dE>dB. Indeed, one can have dE>14dB2. These examples can also be used to give a negative answer to the question of whether additivity of the coherent information is helpful for establishing additivity for the Holevo capacity of a pair of channels. In the case of channels with diagonal Kraus operators, we describe the subclasses that are complements of entanglement breaking channels. We also obtain a number of results for channels in the convex hull of conjugations with generalized Pauli matrices. However, a number of open questions remain about these channels and the more general case of random unitary channels.
This thesis investigates a characterization for the set of antidegradable qubit channels. The characterization comes from a correspondence between the antidegradability of a channel, and the symmetric extendibility of the Choi operator. Using an inequality intended to describe the set of bipartite qubit states which admit symmetric extension, we demonstrate that it additionally provides a condition to characterize the set of antidegradable qubit channels. Using the characterization we investigate the antidegradability of qubit channels with respect to the rank of the Choi matrix. We also apply the antidegradability criterion to the qubit amplitude damping and qubit depolarizing channel. We end by discussing degradable and antidegradable channels in terms of their channel capacities and the applications of these results to investigating phenomena such as super-additive coherent information and superactivation.
Quantum channel capacities give the fundamental performance limits for information flow over a communication channel. However, the prevalence of superadditivity is a major obstacle to understanding capacities, both quantitatively and conceptually. In contrast, examples exhibiting additivity, though relatively rare, offer crucial insights into the origins of nonadditivity and form the basis of our strongest upper bounds on capacity. Degradable channels, whose coherent information is provably additive, stand out as among the few classes of channels for which the quantum capacity is exactly computable. In this paper, we introduce two families of non-degradable channels whose coherent information remains additive, making their quantum capacities tractable. First, we demonstrate that channels capable of “outperforming” their environment, under conditions weaker than degradability, can exhibit either strong or weak additivity of coherent information. Second, we explore a complementary construction that modifies a channel to preserve coherent information additivity while destroying the “outperforming” property. We analyze how structural constraints guarantee strong and weak additivity and investigate how relaxing these constraints leads to the failure of strong additivity, with weak additivity potentially persisting.