arXiv:0807.3977 · Physical Review Letters

Purely Quantum Superadditivity of Classical Capacities of Quantum Multiple Access Channels

Łukasz Czekaj, Paweł Horodecki

Published Mar 19, 2009• 31 citations

Abstract

We are studying classical capacities of quantum memoryless multiaccess channels in geometric terms and we are revealing a break of additivity of the Holevo-like capacity. This effect is a purely quantum mechanical one, since, as we point out, the capacity regions of all classical memoryless multiaccess channels are additive. It is the first such effect revealed in the field of classical information transmission via quantum channels.

DOI: 10.1103/physrevlett.102.110505

Related papers

Superadditivity of multiple access gaussian channels

Łukasz Czekaj, Korbicz Jarek K., Chhajlany Ravindra W. +1 more

We study classical capacity regions of quantum Gaussian multiple access channels (MAC). In classical variants of such channels, whilst some capacity superadditivity-type effects such as the so called water filling effect may be achieved, a fundamental classical additivity law can still be identified, viz. adding resources to one sender is never advantageous to other senders in sending their respective information to the receiver. Here, we show that quantum resources allow violation of this law, by providing an illustrative scheme of an experimentally feasible Gaussian MAC.

NATO science for peace and security series. D, Information and communication securityJan 1, 20100 citations

Nonadditivity of quantum capacities of quantum multiple-access channels and the butterfly network

Peng Fei Huang, Guangqiang He, Jun Zhu +1 more

Multipartite quantum information transmission without additional classical resources is investigated. We show purely quantum superadditivity of quantum capacity regions of quantum memoryless multiple-access (MA) channels, which are not entanglement breaking. Also, we find that the superadditivity holds when the MA channel extends to the quantum butterfly network, which can achieve quantum network coding. The present widespread effects for the channels which enable entanglement distribution have not been revealed for multipartite scenarios.

Physica ScriptaSep 22, 20110 citations

Additivity of the Classical Capacity of Entanglement-Breaking Quantum Channels

Peter W. Shor

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 addition, for the tensor product of two arbitrary quantum channels, we give a bound involving entanglement of formation for the amount of subadditivity (for minimum entropy output) or superadditivity (for classical capacity) that can occur. One of the more important open questions of quantum information theory is the determination of the capacity of a quantum channel for carrying classical information. This question has been only partially resolved. If entanglement between multiple inputs to the channel is not allowed, a formula for the classical capacity of a quantum channel has indeed been discovered [1, 2]. This capacity formula for a quantum channel Ψ is χ ∗ (Ψ) = max p i,ρ i H Ψ(piρi) − ∑

Jan 1, 2002157 citations

Nonadditivity of quantum and classical capacities for entanglement breaking multiple-access channels and the butterfly network

Andrzej Grudka, Paweł Horodecki

We analyze quantum network primitives which are entanglement breaking. We show superadditivity of quantum and classical capacity regions for quantum multiple-access channels and the quantum butterfly network. Since the effects are especially visible at high noise they suggest that quantum information effects may be particularly helpful in the case of the networks with occasional high noise rates. The present effects provide a qualitative borderline between superadditivities of bipartite and multipartite systems.

arXiv:0906.1305Physical Review AJun 23, 201073 citations

Superadditivity in Trade-Off Capacities of Quantum Channels

Elton Yechao Zhu, Quntao Zhuang, Min-Hsiu Hsieh +1 more

In this paper, we investigate the additivity phenomenon in the quantum dynamic capacity region of a quantum channel for trading the resources of classical communication, quantum communication, and entanglement. Understanding such an additivity property is important if we want to optimally use a quantum channel for general communication purposes. However, in a lot of cases, the channel one will be using only has an additive single or double resource capacity region, and it is largely unknown if this could lead to a strictly superadditive double or triple resource capacity region, respectively. For example, if a channel has additive classical and quantum capacities, can the classical-quantum capacity region be strictly superadditive? In this paper, we answer such questions affirmatively. We give proof-of-principle requirements for these channels to exist. In most cases, we can provide an explicit construction of these quantum channels. The existence of these superadditive phenomena is surprising in contrast to the result that the additivity of both classical-entanglement and classical-quantum capacity regions imply the additivity of the triple resource capacity region for a given channel.

arXiv:1708.04314IEEE International Symposium on Information Theory (ISIT)Jun 1, 201821 citations

Nonadditivity of quantum and classical capacities for quantum networks with entanglement breaking lines

Andrzej Grudka, Paweł Horodecki

We analyze quantum network primitives which are entanglement-breaking. We show superadditivity of quantum and classical capacity regions for quantum multiple-access channel and quantum butterfly network. Since the effects are especially visible at high noise they suggest that quantum information effects may be particularly helpful in the case of the networks with occasional high noise rates. To our knowledge the present effects provide the first qualitative borderline between superadditivities of bipartite and multipartite systems.

Jun 6, 20090 citations