English
Related papers

Related papers: Building Multiple Access Channels with a Single Pa…

200 papers

Non-classical features of quantum systems have the potential to strengthen the way we currently exchange information. In this paper, we explore this enhancement on the most basic level of single particles. To be more precise, we compare how…

Quantum Physics · Physics 2024-09-25 Xinan Chen , Yujie Zhang , Andreas Winter , Virginia O. Lorenz , Eric Chitambar

We prove coding theorems for two scenarios of cooperating encoders for the multiple access channel with two classical inputs and one quantum output. In the first scenario (ccq-MAC with common messages), the two senders each have their…

Quantum Physics · Physics 2013-10-09 Holger Boche , Janis Noetzel

Communication networks have multiple users, each sending and receiving messages. A multiple access channel (MAC) models multiple senders transmitting to a single receiver, such as the uplink from many mobile phones to a single base station.…

Quantum Physics · Physics 2020-04-01 Felix Leditzky , Mohammad A. Alhejji , Joshua Levin , Graeme Smith

We consider quantum channels with one sender and two receivers, used in several different ways for the simultaneous transmission of independent messages. We begin by extending the technique of superposition coding to quantum channels with a…

Quantum Physics · Physics 2011-10-25 Jon Yard , Patrick Hayden , Igor Devetak

Extension of point-to-point communication model to the realm of multi-node configurations finds a plethora of applications in internet and telecommunication networks. Here, we establish a novel advantage of quantum communication in a…

A multiple access channel (MAC) consists of multiple senders simultaneously transmitting their messages to a single receiver. For the classical-quantum case (cq-MAC), achievable rates are known assuming that all the messages are decoded, a…

Quantum Physics · Physics 2022-04-26 Masahito Hayashi , Angeles Vazquez-Castro

The multi-access channels in quantum information theory are considered. Classical messages from independent sources, which are represented as some quantum states, are transported by a channel to one address. The messages can interact with…

Quantum Physics · Physics 2007-05-23 A. E. Allahverdyan , D. B. Saakian

In communication networks many different channels must share a limited amount of resources. In order to allow for multiple simultaneous communications, multiple access techniques are routinely employed. With quantum communication, it is…

Quantum Physics · Physics 2007-05-23 Juan Carlos Garcia-Escartin , Pedro Chamorro-Posada

We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multi-letter characterizations of two different two-dimensional capacity regions. The first region characterizes the rates at which it is…

Information Theory · Computer Science 2011-10-25 Jon Yard , Igor Devetak , Patrick Hayden

Suppose that $m$ senders want to transmit classical information to $n$ receivers with zero probability of error using a noisy multipartite communication channel. The senders are allowed to exchange classical, but not quantum, messages among…

Quantum Physics · Physics 2009-06-25 Runyao Duan , Yaoyun Shi

We introduce and analyze an information theoretical task that we call the quantum multiple-access one-time pad. Here, a number of senders initially share a correlated quantum state with a receiver and an eavesdropper. Each sender performs a…

Quantum Physics · Physics 2022-08-26 Eyuri Wakakuwa

We define classical-quantum multiway channels for transmission of classical information, after recent work by Allahverdyan and Saakian. Bounds on the capacity region are derived in a uniform way, which are analogous to the classically known…

Quantum Physics · Physics 2016-11-15 Andreas Winter

We establish a universal complementarity relation between the capacity of classical information transmission by employing a multiparty quantum state as a multiport quantum channel, and the genuine multipartite entanglement of the quantum…

Quantum Physics · Physics 2013-10-30 R. Prabhu , Aditi Sen De , Ujjwal Sen

When a noisy communication channel is used multiple times, the errors occurring at different times generally exhibit correlations. Classically, these correlations do not affect the evolution of individual particles: a single classical…

Quantum Physics · Physics 2021-12-07 Hlér Kristjánsson , Wenxu Mao , Giulio Chiribella

We study communication over a Multiple Access Channel (MAC) where users can possibly be adversarial. The receiver is unaware of the identity of the adversarial users (if any). When all users are non-adversarial, we want their messages to be…

Information Theory · Computer Science 2023-09-12 Neha Sangwan , Mayank Bakshi , Bikash Kumar Dey , Vinod M. Prabhakaran

For combining different single photon channels into single path, we use an effective and reliable technique which is known as quantum multiple access. We take advantage of an add-drop multiplexer capable of pushing and withdrawing a single…

Quantum Physics · Physics 2020-10-29 Vishal Sharma , Subhashish Banerjee

We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multi-letter characterizations of two different two-dimensional capacity regions. The first region is comprised of the rates at which it…

Quantum Physics · Physics 2011-10-25 Jon Yard , Igor Devetak , Patrick Hayden

In communication theory, attacks like eavesdropping or jamming are typically assumed to occur at the channel level, while communication parties are expected to follow established protocols. But what happens if one of the parties turns…

Information Theory · Computer Science 2025-03-25 Minglai Cai , Christian Deppe

Wireless communications at the chip scale emerge as a interesting complement to traditional wire-based approaches thanks to their low latency, inherent broadcast nature, and capacity to bypass pin constraints. However, as current trends…

Emerging Technologies · Computer Science 2023-01-30 Bernat Ollé , Pau Talarn , Albert Cabellos-Aparicio , Filip Lemic , Eduard Alarcón , Sergi Abadal

The necessary and sufficient condition of the channel capacity is rigorously formulated for the N-user discrete memoryless multiple-access channel (MAC). The essence of the formulation is to invoke an {\em elementary} MAC where sizes of…

Information Theory · Computer Science 2007-08-09 Yoichiro Watanabe , Koichi Kamoi
‹ Prev 1 2 3 10 Next ›