English
Related papers

Related papers: Reliability Function of Classical-Quantum Channels

200 papers

The wiretap channel has been devised and studied first by Wyner, and subsequently extended to the case with non-degraded general wiretap channels by Csiszar and Korner. Focusing mainly on the Poisson wiretap channel with cost constraint, we…

Information Theory · Computer Science 2014-08-20 Te Sun Han , Hiroyuki Endo , Masahide Sasaki

Belief propagation is a powerful tool in statistical physics, machine learning, and modern coding theory. As a decoding method, it is ubiquitous in classical error correction and has also been applied to stabilizer-based quantum error…

Quantum Physics · Physics 2017-07-31 Joseph M. Renes

A formula for the capacity of a quantum channel for transmitting private classical information is derived. This is shown to be equal to the capacity of the channel for generating a secret key, and neither capacity is enhanced by forward…

Quantum Physics · Physics 2007-05-23 I. Devetak

R\'enyi and Augustin information are generalizations of mutual information defined via the R\'enyi divergence, playing a significant role in evaluating the performance of information processing tasks by virtue of its connection to the error…

Quantum Physics · Physics 2022-05-31 Hao-Chung Cheng , Li Gao , Min-Hsiu Hsieh

Holevo, Schumacher, and Westmoreland's coding theorem guarantees the existence of codes that are capacity-achieving for the task of sending classical data over a channel with classical inputs and quantum outputs. Although they demonstrated…

Quantum Physics · Physics 2013-01-21 Mark M. Wilde , Saikat Guha

In analogy with its classical counterpart, a noisy quantum channel is characterized by a loss, a quantity that depends on the channel input and the quantum operation performed by the channel. The loss reflects the transmission quality: if…

Quantum Physics · Physics 2011-07-19 Nicolas J. Cerf

We investigate bounds in the transmission of classical information through quantum systems. Our focus lies in the generalized Holevo theorem, which provides a single-letter Holevo-like inequality from arbitrary quantum distance measures.…

We use the smooth entropy approach to treat the problems of binary quantum hypothesis testing and the transmission of classical information through a quantum channel. We provide lower and upper bounds on the optimal type II error of quantum…

Quantum Physics · Physics 2013-12-11 Nilanjana Datta , Milan Mosonyi , Min-Hsiu Hsieh , Fernando G. S. L. Brandao

The rates at which classical and quantum information can be simultaneously transmitted from two spatially separated senders to a single receiver over an arbitrary quantum channel are characterized. Two main results are proved in detail. The…

Quantum Physics · Physics 2007-05-23 Jon Yard

In network communication, it is common in broadcasting scenarios for there to exist a hierarchy among receivers based on information they decode due, for example, to different physical conditions or premium subscriptions. This hierarchy may…

Quantum Physics · Physics 2024-06-17 Farzin Salek , Patrick Hayden , Masahito Hayashi

We consider the discrete memoryless symmetric primitive relay channel, where, a source $X$ wants to send information to a destination $Y$ with the help of a relay $Z$ and the relay can communicate to the destination via an error-free…

Information Theory · Computer Science 2016-03-31 Xiugang Wu , Ayfer Ozgur , Liang-Liang Xie

This paper investigates the maximal secret communication rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are uniformly tighter than…

Information Theory · Computer Science 2017-06-14 Wei Yang , Rafael F. Schaefer , H. Vincent Poor

A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…

Information Theory · Computer Science 2016-11-15 Zheng Wang , Jie Luo

The Holevo quantity provides an upper bound for the mutual information between the sender of a classical message encoded in quantum carriers and the receiver. Applying the strong sub-additivity of entropy we prove that the Holevo quantity…

Quantum Physics · Physics 2015-05-18 Wojciech Roga , Mark Fannes , Karol Zyczkowski

Quantum information science strives to leverage the quantum-mechanical nature of our universe in order to achieve large improvements in certain information processing tasks. In deep-space optical communications, current receivers for the…

Quantum Physics · Physics 2020-04-16 Narayanan Rengaswamy

In this work we improve the quantum communication rates of various quantum channels of interest using permutation-invariant quantum codes. We focus in particular on parametrized families of quantum channels and aim to improve bounds on…

Quantum Physics · Physics 2025-08-14 Sujeet Bhalerao , Felix Leditzky

The locking effect is a phenomenon which is unique to quantum information theory and represents one of the strongest separations between the classical and quantum theories of information. The Fawzi-Hayden-Sen (FHS) locking protocol…

Determining the ultimate classical information carrying capacity of electromagnetic waves requires quantum-mechanical analysis to properly account for the bosonic nature of these waves. Recent work has established capacity theorems for…

Quantum Physics · Physics 2008-02-10 Saikat Guha , Jeffrey H. Shapiro , Baris I. Erkmen

This paper considers the problem of efficiently transmitting quantum states through a network. It has been known for some time that without additional assumptions it is impossible to achieve this task perfectly in general -- indeed, it is…

Quantum Physics · Physics 2016-05-30 Hirotada Kobayashi , François Le Gall , Harumichi Nishimura , Martin Roetteler

We determine the secrecy capacity of the compound channel with quantum wiretapper and channel state information at the transmitter. Moreover, we derive a lower bound on the secrecy capacity of this channel without channel state information…

Information Theory · Computer Science 2015-06-15 Holger Boche , Minglai Cai , Ning Cai , Christian Deppe
‹ Prev 1 8 9 10 Next ›