English
Related papers

Related papers: Sequential, successive, and simultaneous decoders …

200 papers

We consider the scenario of communicating on a $3\mhyphen$user classical-quantum broadcast channel. We undertake an information theoretic study and focus on the problem of characterizing an inner bound to its capacity region. We design a…

Information Theory · Computer Science 2025-03-14 Fatma Gouiaa , Arun Padakandla

Quantum resources, such as entanglement or quantum communication, offer significant communication advantages in information processing. We develop an operational framework for realizing these communication advantages in resource-constrained…

Quantum Physics · Physics 2026-04-16 Brian Doolittle , Felix Leditzky , Eric Chitambar

We study the problem of simulating a two-user multiple-access channel (MAC) over a multiple access network of noiseless links. Two encoders observe independent and identically distributed (i.i.d.) copies of a source random variable each,…

Information Theory · Computer Science 2023-12-08 Gowtham R. Kurri , Viswanathan Ramachandran , Sibi Raj B. Pillai , Vinod M. Prabhakaran

This work investigates the general two-user Compound Broadcast Channel (BC) where an encoder wishes to transmit common and private messages to two receivers while being oblivious to two possible channel realizations controlling the…

Information Theory · Computer Science 2014-10-21 Meryem Benammar , Pablo Piantanida , Shlomo Shamai

We present a general theory of entanglement-assisted quantum convolutional coding. The codes have a convolutional or memory structure, they assume that the sender and receiver share noiseless entanglement prior to quantum communication, and…

Quantum Physics · Physics 2013-04-15 Mark M. Wilde , Todd A. Brun

Polar coding is a method for communication over noisy classical channels which is provably capacity-achieving and has an efficient encoding and decoding. Recently, this method has been generalized to the realm of quantum information…

Quantum Physics · Physics 2016-02-01 Christoph Hirche , Ciara Morgan , Mark M. Wilde

In this work we study the problem of secure communication over a fully quantum Gel'fand-Pinsker channel. The best known achievability rate for this channel model in the classical case was proven by Goldfeld, Cuff and Permuter in [Goldfeld,…

Quantum Physics · Physics 2021-05-26 Anurag Anshu , Masahito Hayashi , Naqueeb Ahmad Warsi

We derive universal classical-quantum superposition coding and universal classical-quantum multiple access channel code by using generalized packing lemmas for the type method. Using our classical-quantum universal superposition code, we…

Quantum Physics · Physics 2022-04-26 Masahito Hayashi , Ning Cai

Quantum teleportation is a quantum communication primitive that allows a long-distance quantum channel to be built using pre-shared entanglement and one-way classical communication. However, the quality of the established channel crucially…

Quantum Physics · Physics 2024-06-05 Eric Chitambar , Felix Leditzky

Completely depolarising channels are often regarded as the prototype of physical processes that are useless for communication: any message that passes through them along a well-defined trajectory is completely erased. When two such channels…

Quantum Physics · Physics 2021-11-10 Giulio Chiribella , Matt Wilson , H. F. Chau

Communication scenarios between two parties can be implemented by first encoding messages into some states of a physical system which acts as the physical medium of the communication and then decoding the messages by measuring the state of…

Quantum Physics · Physics 2024-04-23 Teiko Heinosaari , Oskari Kerppo , Leevi Leppäjärvi , Martin Plávala

Understanding the classical communication cost of simulating a quantum channel is a fundamental problem in quantum information theory, which becomes even more intriguing when considering the role of non-locality in quantum information…

Quantum Physics · Physics 2025-07-29 Chengkai Zhu , Xuanqiang Zhao , Xin Wang

The single-letter characterisation of the entanglement-assisted capacity of a quantum channel is one of the seminal results of quantum information theory. In this paper, we consider a modified communication scenario in which the receiver is…

Quantum Physics · Physics 2024-09-16 Kaiyuan Ji , Bartosz Regula , Mark M. Wilde

In this paper, we study quantum dense coding between two arbitrarily fixed particles in a (N+2)-particle maximally-entangled states through introducing an auxiliary qubit and carrying out local measurements. It is shown that the transmitted…

Quantum Physics · Physics 2009-11-10 Jian-Lan Chen , Le-Man Kuang

Encoding schemes and error-correcting codes are widely used in information technology to improve the reliability of data transmission over real-world communication channels. Quantum information protocols can further enhance the performance…

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

We present a dense coding scheme between one sender and two receivers, which guarantees that the receivers simultaneously obtain their respective messages. In our scheme, the quantum entanglement channel is first locked by the sender so…

Quantum Physics · Physics 2015-05-14 Haozhen Situ , Daowen Qiu

Like a silver thread, quantum entanglement [1] runs through the foundations and breakthrough applications of quantum information theory. It cannot arise from local operations and classical communication (LOCC) and therefore represents a…

Entanglement is the cornerstone of quantum communication, yet conventional detection relies solely on local measurements. In this work, we present a unified theoretical and experimental framework demonstrating that one-way local operations…

We study a linear computation problem over a quantum multiple access channel (LC-QMAC), where $S$ servers share an entangled state and separately store classical data streams $W_1,\cdots, W_S$ over a finite field $\mathbb{F}_d$. A user aims…

Information Theory · Computer Science 2025-01-28 Lei Hu , Mohamed Nomeir , Alptug Aytekin , Yu Shi , Sennur Ulukus , Saikat Guha