English
Related papers

Related papers: Second-order coding rates for pure-loss bosonic ch…

200 papers

We consider the problem of communicating over a channel that breaks the message block into fragments of random lengths, shuffles them out of order, and deletes a random fraction of the fragments. Such a channel is motivated by applications…

Information Theory · Computer Science 2024-07-09 Aditya Narayan Ravi , Alireza Vahid , Ilan Shomorony

Discriminating between noisy quantum processes is a central primitive for quantum communication, metrology, and computing. While discrimination limits for finite-dimensional channels are well understood, the continuous-variable setting,…

Quantum Physics · Physics 2026-03-23 Zixin Huang , Ludovico Lami , Vishal Singh , Mark M. Wilde

We study two-receiver Poisson channels using tools derived from stochastic calculus. We obtain a general formula for the mutual information over the Poisson channel that allows for conditioning and the use of auxiliary random variables. We…

Information Theory · Computer Science 2019-11-12 Nirmal V. Shende , Aaron B. Wagner

This work considers a Poisson noise channel with an amplitude constraint. It is well-known that the capacity-achieving input distribution for this channel is discrete with finitely many points. We sharpen this result by introducing upper…

Information Theory · Computer Science 2021-07-30 Alex Dytso , Luca Barletta , Shlomo Shamai

The paper establishes the capacity region of the Gaussian interference channel with many transmitter-receiver pairs constrained to use point-to-point codes. The capacity region is shown to be strictly larger in general than the achievable…

Information Theory · Computer Science 2011-02-15 Francois Baccelli , Abbas El Gamal , David Tse

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

We study the problem of transmitting classical information using quantum Gaussian states on a family of phase-noise channels with a finite decoherence time, such that the phase-reference is lost after $m$ consecutive uses of the…

A scheme for transferring classical information over a lossy bosonic channel is proposed by generalizing the proposal presented in Phys. Rev. Lett. 106, 240502 (2011) by Guha. It employs codewords formed by products of coherent states of…

Quantum Physics · Physics 2016-12-21 Matteo Rosati , Andrea Mari , Vittorio Giovannetti

Bosonic pure-loss channel, which represents the process of photons decaying into a vacuum environment, has zero quantum capacity when the channel's transmissivity is less than 50%. Modeled as a beam splitter interaction between the system…

Quantum Physics · Physics 2025-04-15 Zhaoyou Wang , Liang Jiang

A minimax converse for the identification via channels is derived. By this converse, a general formula for the identification capacity, which coincides with the transmission capacity, is proved without the assumption of the strong converse…

Information Theory · Computer Science 2021-01-15 Shun Watanabe

This paper establishes the exact strong converse exponent of the soft covering problem in the classical setting. This exponent characterizes the slowest achievable convergence speed of the total variation to one when a code of rate below…

Information Theory · Computer Science 2026-04-01 Xingyi He , S. Sandeep Pradhan , Andreas Winter

Recent work has precisely characterized the achievable trade-offs between three key information processing tasks---classical communication (generation or consumption), quantum communication (generation or consumption), and shared…

Quantum Physics · Physics 2012-06-22 Mark M. Wilde , Patrick Hayden , Saikat Guha

We consider the transmission of a memoryless bivariate Gaussian source over an average-power-constrained one-to-two Gaussian broadcast channel. The transmitter observes the source and describes it to the two receivers by means of an…

Information Theory · Computer Science 2009-03-20 Shraga Bross , Amos Lapidoth , Stephan Tinguely

We study the problem of channel resolvability for fixed i.i.d. input distributions and discrete memoryless channels (DMCs), and derive the strong converse theorem for any DMCs that are not necessarily full rank. We also derive the optimal…

Information Theory · Computer Science 2014-04-23 Shun Watanabe , Masahito Hayashi

In this paper, the capacity of a diffusion based molecular communication network under the model of a Linear Time Invarient-Poisson (LTI-Poisson) channel is studied. Introduced in the context of molecular communication, the LTI-Poisson…

Information Theory · Computer Science 2014-10-17 Hamidreza Arjmandi , Gholamali Aminian , Amin Gohari , Masoumeh Nasiri Kenari , Urbashi Mitra

Recently, a coding technique called position-based coding has been used to establish achievability statements for various kinds of classical communication protocols that use quantum channels. In the present paper, we apply this technique in…

Quantum Physics · Physics 2018-10-10 Haoyu Qi , Qingle Wang , Mark M. Wilde

A new converse bound is presented for the two-user multiple-access channel under the average probability of error constraint. This bound shows that for most channels of interest, the second-order coding rate -- that is, the difference…

Information Theory · Computer Science 2021-10-04 Oliver Kosut

Thermal attenuator channels model the decoherence of quantum systems interacting with a thermal bath, e.g., a two-level system subject to thermal noise and an electromagnetic signal travelling through a fiber or in free-space. Hence…

Quantum Physics · Physics 2018-12-12 Matteo Rosati , Andrea Mari , Vittorio Giovannetti

The feedback capacity of the stationary Gaussian additive noise channel has been open, except for the case where the noise is white. Here we find the feedback capacity of the stationary first-order moving average additive Gaussian noise…

Information Theory · Computer Science 2007-07-16 Young-Han Kim

We consider compound as well as arbitrarily varying classical-quantum channel models. For classical-quantum compound channels, we give an elementary proof of the direct part of the coding theorem. A weak converse under average error…

Quantum Physics · Physics 2016-08-14 Igor Bjelaković , Holger Boche , Gisbert Janßen , Janis Nötzel