English
Related papers

Related papers: The Multiple-Access Channel with Entangled Transmi…

200 papers

We consider the problem of broadcast with common messages, and focus on the case that the common message rate $R_{\mathcal{A}}$, i.e., the rate of the message intended for all the receivers in the set $\mathcal{A}$, is the same for all the…

Information Theory · Computer Science 2016-11-17 Chao Tian

This paper investigates the capacity problem for some multiple-access scenarios with cooperative transmitters. First, a general Multiple-Access Channel (MAC) with common information, i.e., a scenario where p transmitters send private…

Information Theory · Computer Science 2013-02-17 Ali Haghi , Reza K. Farsani , Mohammad Reza Aref , Farokh Marvasti

Capacity of a quantum channel characterizes the limits of reliable communication through a noisy quantum channel. This fundamental information theoretic question is very well studied specially in the setting of many independent uses of the…

Quantum Physics · Physics 2019-03-19 Anurag Anshu , Rahul Jain , Naqueeb Ahmad Warsi

We derive the capacity region of arbitrarily varying multiple-access channels with conferencing encoders for both deterministic and random coding. For a complete description it is sufficient that one conferencing capacity is positive. We…

Information Theory · Computer Science 2012-11-21 Moritz Wiese , Holger Boche

Entanglement resources can increase transmission rates substantially. Unfortunately, entanglement is a fragile resource that is quickly degraded by decoherence effects. In order to generate entanglement for optical communication, the…

Quantum Physics · Physics 2023-03-07 Uzi Pereg , Christian Deppe , Holger Boche

We study information transmission over a fully correlated amplitude damping channel acting on two qubits. We derive the single-shot classical channel capacity and show that entanglement is needed to achieve the channel best performance. We…

Quantum Physics · Physics 2013-11-01 A. D'Arrigo , G. Benenti , G. Falci , C. Macchiavello

We analyze utility of communication channels in absence of any short of quantum or classical correlation shared between the sender and the receiver. To this aim, we propose a class of two-party communication games, and show that the games…

In this paper we study the multiple access channel (MAC) with combined cooperation and partial cribbing and characterize its capacity region. Cooperation means that the two encoders send a message to one another via a rate-limited link…

Information Theory · Computer Science 2014-04-04 Tal Kopetz , Haim Permuter , Shlomo Shamai

We show that the inherent entanglement of the ground state of strongly correlated systems can be exploited for both classical and quantum communications. Our strategy is based on a single qubit rotation which encodes information in the…

Quantum Physics · Physics 2011-08-08 Song Yang , Abolfazl Bayat , Sougato Bose

We show strongly secret achievable rate regions for two different wiretap multiple-access channel coding problems. In the first problem, each encoder has a private message and both together have a common message to transmit. The encoders…

Information Theory · Computer Science 2014-06-05 Moritz Wiese , Holger Boche

We consider two-stage hybrid protocols that combine quantum resource and classical resource to generate classical correlations shared by two separated players. Our motivation is twofold. First, in the near future the scale of quantum…

Quantum Physics · Physics 2020-07-22 Xiaodie Lin , Zhaohui Wei , Penghui Yao

A discrete memoryless generalized multiple access channel (GMAC) with confidential messages is studied, where two users attempt to transmit common information to a destination and each user also has private (confidential) information…

Information Theory · Computer Science 2007-07-13 Yingbin Liang , H. Vincent Poor

We study private classical communication over quantum multiple-access channels. For an arbitrary number of transmitters, we derive a regularized expression of the capacity region. In the case of degradable channels, we establish a…

Information Theory · Computer Science 2022-01-31 Remi A. Chou

The maximal amount of information which is reliably transmitted over two uses of general Pauli channels with memory is proven to be achieved by maximally entangled states beyond some memory threshold. In particular, this proves a conjecture…

Quantum Physics · Physics 2011-11-09 D. Daems

The problem of resource allocation is studied for two-sender two-receiver fading Gaussian interference channels (IFCs) and compound multiaccess channels (C-MACs). The senders in an IFC communicate with their own receiver (unicast) while…

Information Theory · Computer Science 2016-11-15 Lalitha Sankar , Elza Erkip , H. Vincent Poor

The problem of multicasting two nested messages is studied over a class of networks known as combination networks. A source multicasts two messages, a common and a private message, to several receivers. A subset of the receivers (called the…

Information Theory · Computer Science 2016-01-08 Shirin Saeedi Bidokhti , Vinod Prabhakaran , Suhas Diggavi

Multiplexing services as a key communication technique to effectively combine multiple signals into one signal and transmit over a shared medium. Multiplexing can increase the channel capacity by requiring more resources on the transmission…

Information Theory · Computer Science 2017-12-27 Chunlin Ji , Ruopeng Liu

We consider communication between two parties using a bipartite quantum operation, which constitutes the most general quantum mechanical model of two-party communication. We primarily focus on the simultaneous forward and backward…

Quantum Physics · Physics 2014-11-18 Andrew M. Childs , Debbie W. Leung , Hoi-Kwong Lo

Entanglement bits or ``ebits'' have been proposed as a quantitative measure of a fundamental resource in quantum information processing. For such an interpretation to be valid, it is important to show that the same number of ebits in…

Quantum Physics · Physics 2009-10-31 Hoi-Kwong Lo , Sandu Popescu

We consider a two user multiple-access channel with an eavesdropper at the receiving end. We use previously transmitted messages as a key in the next slot till we achieve the capacity region of the usual Multiple Access Channel (MAC).

Information Theory · Computer Science 2014-11-03 Shahid Mehraj Shah , Vinod Sharma