English
Related papers

Related papers: Classical capacity of bosonic broadcast communicat…

200 papers

The maximum rates for reliably transmitting classical information over Bosonic multiple-access channels (MACs) are derived when the transmitters are restricted to coherent-state encodings. Inner and outer bounds for the ultimate capacity…

Quantum Physics · Physics 2009-11-11 Brent J. Yen , Jeffrey H. Shapiro

The present paper is devoted to investigation of the classical capacity of infinite-dimensional quantum measurement channels. A number of usable conditions are introduced that enable us to apply previously obtained general results to…

Quantum Physics · Physics 2020-08-31 A. S. Holevo , A. A. Kuznetsova

This paper shows that the capacity region of the continuous-time Poisson broadcast channel is achieved via superposition coding for most channel parameter values. Interestingly, the channel in some subset of these parameter values does not…

Information Theory · Computer Science 2015-08-28 Hyeji Kim , Benjamin Nachman , Abbas El Gamal

In many complex systems, whether biological or artificial, the thermodynamic costs of communication among their components are large. These systems also tend to split information transmitted between any two components across multiple…

Statistical Mechanics · Physics 2024-02-12 Farita Tasnim , Nahuel Freitas , David H. Wolpert

We establish the classical capacity of optical quantum channels as a sharp transition between two regimes---one which is an error-free regime for communication rates below the capacity, and the other in which the probability of correctly…

Quantum Physics · Physics 2015-03-17 Bhaskar Roy Bardhan , Raul Garcia-Patron , Mark M. Wilde , Andreas Winter

The maximum rates for information transmission through noisy quantum channels has primarily been developed for memoryless channels, where the noise on each transmitted state is treated as independent. Many real world communication channels…

Quantum Physics · Physics 2009-11-10 Garry Bowen , Igor Devetak , Stefano Mancini

We provide lower and upper bounds on the information transmission capacity of one single use of a classical-quantum channel. The lower bound is expressed in terms of the Hoeffding capacity, that we define similarly to the Holevo capacity,…

Quantum Physics · Physics 2009-07-24 Milan Mosonyi , Nilanjana Datta

We present a method to detect lower bounds to the classical capacity of quantum communication channels by means of few local measurements (i.e. without complete process tomography), reconstruction of sets of conditional probabilities, and…

Quantum Physics · Physics 2019-08-30 Chiara Macchiavello , Massimiliano F. Sacchi

In this paper, the capacity of continuous-space electromagnetic channels, where transceivers are confined in given lossy regions, is analyzed. First of all, the regions confining the transceivers are assumed to be filled with dielectric,…

Information Theory · Computer Science 2016-06-21 Wonseok Jeon , Sae-Young Chung

The classical capacity of the lossy bosonic channel is calculated exactly. It is shown that its Holevo information is not superadditive, and that a coherent-state encoding achieves capacity. The capacity of far-field, free-space optical…

Communication channels are said to be underspread if their coherence time is greater than their delay spread. In such cases it can be shown that in the infinite bandwidth limit the information capacity tends to that of a channel with…

Information Theory · Computer Science 2014-06-24 Steven Herbert , Ian Wassell , Tian-Hong Loh

The one-shot classical capacity of a quantum channel quantifies the amount of classical information that can be transmitted through a single use of the channel such that the error probability is below a certain threshold. In this work, we…

Quantum Physics · Physics 2013-01-29 Ligong Wang , Renato Renner

In physical-layer security, one of the most fundamental issues is the secrecy capacity. The objective of this paper is to determine the secrecy capacity for an indoor visible light communication system consisting of a transmitter, a…

Information Theory · Computer Science 2021-09-24 Jin-Yuan Wang , Xian-Tao Fu , Jun-Bo Wang , Min Lin , Julian Cheng , Mohamed-Slim Alouini

The two-user wireless ergodic fading Broadcast Channel (BC) with partial Channel State Information at the Transmitter (CSIT) is considered. The CSIT is given by an arbitrary deterministic function of the channel state. This characteristic…

Information Theory · Computer Science 2013-02-25 Reza K. Farsani

In this article, we are proposing a closed-form solution for the capacity of the single quantum channel. The Gaussian distributed input has been considered for the analytical calculation of the capacity. In our previous couple of papers, we…

Information Theory · Computer Science 2023-02-17 Mouli Chakraborty , Harun Siljak , Indrakshi Dey , Nicola Marchetti

We consider a broadcast scenario where one transmitter communicates with two receivers under quality-of-service constraints. The transmitter initially employs superposition coding strategies with arbitrarily distributed signals and sends…

Information Theory · Computer Science 2016-03-09 Marwan Hammouda , Sami Akin , Jürgen Peissig

The first terms of the low-signal-energy asymptotics for the mutual information in the discrete-time Poisson channel are derived and compared to an asymptotic expression of the capacity. In the presence of non-zero additive noise (either…

Information Theory · Computer Science 2008-08-21 Alfonso Martinez

The purpose of this work is to extend the result of previous papers quant-ph/9611023, quant-ph/9703013 to quantum channels with additive constraints onto the input signal, by showing that the capacity of such channel is equal to the…

Quantum Physics · Physics 2007-05-23 A. S. Holevo

We develop a model for a noisy communication channel in which the noise affecting consecutive transmissions is correlated. This model is motivated by fluctuating birefringence of fiber optic links. We analyze the role of entanglement of the…

Quantum Physics · Physics 2009-11-10 Jonathan Ball , Andrzej Dragan , Konrad Banaszek

We study the classical problem of noisy constrained capacity in the case of the binary symmetric channel (BSC), namely, the capacity of a BSC whose inputs are sequences chosen from a constrained set. Motivated by a result of Ordentlich and…

Probability · Mathematics 2009-08-10 Guangyue Han , Brian Marcus
‹ Prev 1 3 4 5 6 7 10 Next ›