We present an experimental approach to construct a dephrasure channel that contains both dephasing and erasure noises and can be used as an efficient tool to study the superadditivity of coherent information. Using a three-fold dephrasure channel, the superadditivity of coherent information is observed, and a substantial gap is found between the zero single-letter coherent information and zero quantum capacity. Particularly, we find that, when the coherent information of n channel uses is zero, with a larger number of channel uses the quantum capacity becomes positive. These phenomena exhibit a more obvious superadditivity of coherent information than previous works and demonstrate a higher threshold for nonzero quantum capacity. Such novel channels built in our experiment also can provide a useful platform to study the nonadditive properties of coherent information and quantum channel capacity.
We present an experimental approach to construct a dephrasure channel that contains both dephasing and erasure noises and can be used as an efficient tool to study the superadditivity of coherent information. Using a three-fold dephrasure channel, the superadditivity of coherent information is observed, and a substantial gap is found between the zero single-letter coherent information and zero quantum capacity. Particularly, we find that, when the coherent information of n channel uses is zero, with a larger number of channel uses the quantum capacity becomes positive. These phenomena exhibit a more obvious superadditivity of coherent information than previous works and demonstrate a higher threshold for nonzero quantum capacity. Such novel channels built in our experiment also can provide a useful platform to study the nonadditive properties of coherent information and quantum channel capacity.
The quantum capacity of a quantum channel captures its capability for noiseless quantum communication. It lies at the heart of quantum information theory. Unfortunately, our poor understanding of nonadditivity of coherent information makes it hard to understand the quantum capacity of all but very special channels. In this Letter, we consider the dephrasure channel, which is the concatenation of a dephasing channel and an erasure channel. This very simple channel displays remarkably rich and exotic properties: we find nonadditivity of coherent information at the two-letter level, a substantial gap between the threshold for zero quantum capacity and zero single-letter coherent information, a big gap between single-letter coherent and private information, and positive quantum capacity for all complementary channels. Its clean form simplifies the evaluation of coherent information substantially and, as such, we hope that the dephrasure channel will provide a much-needed laboratory for the testing of new ideas about nonadditivity.
Quantum capacity quantifies the amount of quantum information that can be transmitted by a quantum channel with an arbitrary small probability of error. Mathematically, the quantum capacity is given by an asymptotic formula involving the one-shot quantum capacity of the associated channel, which, due to purely quantum effects such as superadditivity of one-shot quantum capacity, is rarely computable. The one-shot quantum capacity is mathematically characterized in terms of optimizing an entropic quantity referred to as coherent information over all possible input states of a channel, the computation of which also tends to be intractable due to the difficulty of optimizing the coherent information. In this work, we develop perturbative methods for analyzing the behavior of coherent information of a quantum channel with respect to small perturbations of the input state. By doing so, we are able to derive three general criteria for determining whether an input state yields suboptimal coherent information. We then show how our criteria yield sufficient conditions for superadditivity of one-shot quantum capacity, and also for detecting a positive gap between one-shot private capacity and one-shot quantum capacity. The utility of our criteria is illustrated through examples, which yield new results regarding the one-shot quantum capacity of qubit depolarizing channels, Pauli channels and dephrasure channels.
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 due to superadditivity effects. Studying these phenomena is important for deepening our understanding of quantum information, yet simple and clean examples of superadditive channels are scarce. Here we study a family of channels called platypus channels. Its simplest member, a qutrit channel, is shown to display superadditivity of coherent information when used jointly with a variety of qubit channels. Higher-dimensional family members display superadditivity of quantum capacity together with an erasure channel. Subject to the "spin-alignment conjecture" introduced in our companion paper [F. Leditzky, D. Leung, V. Siddhu, G. Smith, and J. A. Smolin, The platypus of the quantum channel zoo, IEEE Transactions on Information Theory (IEEE, 2023), 10.1109/TIT.2023.3245985], our results on superadditivity of quantum capacity extend to lower-dimensional channels as well as larger parameter ranges. In particular, superadditivity occurs between two weakly additive channels each with large capacity on their own, in stark contrast to previous results. Remarkably, a single, novel transmission strategy achieves superadditivity in all examples. Our results show that superadditivity is much more prevalent than previously thought. It can occur across a wide variety of channels, even when both participating channels have large quantum capacity.
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. Examples of additivity, while rare, provide key insight into the origins of nonadditivity and enable our best upper bounds on capacities. Degradable channels, which have additive coherent information, are some of the only channels for which we can calculate the quantum capacity. 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.
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.
Superadditivity of quantum capacity of communication channels is one of the most interesting findings of the field. Yard and Smith, finding a relation between the private capacity and the assisted quantum capacity, showed a striking example of superadditivity, i.e. two channels of zero quantum capacity could achieve a positive quantum capacity when used together [1]. The four dimensional channels they used are a 50% erasure channel (therefore zero quantum capacity, due to no-cloning theorem) and a Horodecki channel (again zero quantum capacity due to incapability of sharing free entanglement). In this work we present the more general cases of superadditivity. Directly calculating the lower bounds of joint quantum capacities without using the relation between private capacity and assisted quantum capacity, we examine scenarios considering erasure channels of arbitrary probabilities and different Horodecki channels, and discuss the roles of degradability and anti-degradability as well as the role of the private capacity in superadditivity. We also derive an upper bound for the joint quantum capacity for the superactivation case.