English
Related papers

Related papers: Classical Capacity of A Quantum Multiple Access Ch…

200 papers

We study the problem of transmission of classical messages through a quantum channel in several network scenarios in the one-shot setting. We consider both the entanglement assisted and unassisted cases for the point to point quantum…

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

Transmitting data reliably over noisy communication channels is one of the most important applications of information theory, and well understood when the channel is accurately modelled by classical physics. However, when quantum effects…

In most communication scenarios, sending a symbol encoded in a quantum state requires spending resources such as energy, which can be quantified by a cost of communication. A standard approach in this context is to quantify the performance…

Quantum Physics · Physics 2017-10-09 Marcin Jarzyna

This paper considers the problem of communication over a memoryless classical-quantum wiretap channel subject to the constraint that the eavesdropper on the channel should not be able to learn whether the legitimate parties are using the…

Information Theory · Computer Science 2017-03-08 Ligong Wang

The nonadditivity of channel capacity is a defining feature that distinguishes quantum communication from classical communication. In the quantum realm, the channel capacity is determined by coherent information, which is defined through…

Quantum Physics · Physics 2026-05-19 Yu Guo , Bo-Xuan Wang , Xiao-Min Hu , Yun-Feng Huang , Chuan-Feng Li , Guang-Can Guo , Bi-Heng Liu

We present two approaches for transmitting classical information over quantum broadcast channels. The first technique is a quantum generalization of the superposition coding scheme for the classical broadcast channel. We use a quantum…

Quantum Physics · Physics 2015-11-12 Ivan Savov , Mark M. Wilde

While a positive operator valued measure gives the probabilities in a quantum measurement, an instrument gives both the probabilities and the a posteriori states. By interpreting the instrument as a quantum channel and by using the…

Quantum Physics · Physics 2007-05-23 Alberto Barchielli , Giancarlo Lupieri

Several relations between the Holevo capacity and the entanglement-assisted classical capacity of a quantum channel are proved, necessary and sufficient conditions for their coincidence are obtained. In particular, it is shown that these…

Quantum Physics · Physics 2012-08-10 M. E. Shirokov

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 analyze different aspects of multiparty communication over quantum memoryless channels and generalize some of key results known from bipartite channels to that of multiparty scenario. In particular, we introduce multiparty versions of…

Quantum Physics · Physics 2009-11-13 Maciej Demianowicz , Pawel Horodecki

Large-scale communication networks, such as the internet, rely on routing packets of data through multiple intermediate nodes to transmit information from a sender to a receiver. In this paper, we develop a model of a quantum communication…

Quantum Physics · Physics 2023-09-28 Hlér Kristjánsson , Yan Zhong , Anthony Munson , Giulio Chiribella

Due to Csiszar and Koerner, the private capacity of classical wiretap channels has a single-letter characterization in terms of the private information. For quantum wiretap channels, however, it is known that regularization of the private…

Quantum Physics · Physics 2021-06-29 Arkin Tikku , Mario Berta , Joseph M. Renes

Previous work on the classical information capacities of bosonic channels has established the capacity of the single-user pure-loss channel, bounded the capacity of the single-user thermal-noise channel, and bounded the capacity region of…

Quantum Physics · Physics 2009-11-13 Saikat Guha , Jeffrey H. Shapiro , Baris I. Erkmen

The present work continues investigation of the capacities of measurement (quantum-classical) channels in the most general setting, initiated in~\cite{HCT}. The proof of coding theorems is given for the classical capacity and…

Quantum Physics · Physics 2014-08-15 A. A. Kuznetsova , A. S. Holevo

We study covert classical communication over a quantum multiple-access channel (MAC) with a helper. Specifically, we consider three transmitters, where one transmitter helps the other two transmitters communicate covertly with a receiver.…

Information Theory · Computer Science 2025-12-03 Hassan ZivariFard , Rémi A. Chou , Xiaodong Wang

We present a communication protocol for the erasure channel assisted by backward classical communication, which achieves a significantly better rate than the best prior result. In addition, we prove an upper bound for the capacity of the…

Quantum Physics · Physics 2013-05-29 Debbie Leung , Joungkeun Lim , Peter 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…

Quantum Physics · Physics 2015-06-26 Peter W. Shor

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

Communication over a quantum broadcast channel with cooperation between the receivers is considered. The first form of cooperation addressed is classical conferencing, where Receiver 1 can send classical messages to Receiver 2. Another…

Information Theory · Computer Science 2021-06-18 Uzi Pereg , Christian Deppe , Holger Boche

Classical multiuser information theory studies the fundamental limits of models with a fixed (often small) number of users as the coding blocklength goes to infinity. This work proposes a new paradigm, referred to as {\em many-user…

Information Theory · Computer Science 2017-02-13 Xu Chen , Tsung-Yi Chen , Dongning Guo