Related papers: Universal Limit on Communication
We give the trade-off curve showing the capacity of a quantum channel as a function of the amount of entanglement used by the sender and receiver for transmitting information. The endpoints of this curve are given by the…
The Shannon upper bound places a limit on the error-free information transmission rate (capacity) of a noisy channel. It has stood for over sixty years, and underlies both theoretical and practical work in the telecommunications industry.…
We establish the fundamental limit of communication capacity within Gaussian schemes under phase-insensitive Gaussian channels, which employ multimode Gaussian states for encoding and collective Gaussian operations and measurements for…
We present an alternative take on the recently popularized concept of `\textit{joint sensing and communications}', which focuses on using communication resources also for sensing. Here, we propose the opposite, where we utilize the…
Communication over a noisy quantum channel introduces errors in the transmission that must be corrected. A fundamental bound on quantum error correction is the quantum capacity, which quantifies the amount of quantum data that can be…
We consider a nontrivial class of infinite dimensional quantum channels characterized by finiteness of the Holevo capacity. Some general properties of channels of this class are described. In particular, a special sufficient condition of…
This note will introduce some notation and definitions for information theoretic quantities in the context of quantum systems, such as (conditional) entropy and (conditional) mutual information. We will employ the natural C*-algebra…
An upper limit is given to the amount of quantum information that can be transmitted reliably down a noisy, decoherent quantum channel. A class of quantum error-correcting codes is presented that allow the information transmitted to attain…
We consider communication between two parties using a bipartite quantum operation, which constitutes the most general quantum mechanical model of two-party communication. We primarily focus on the simultaneous forward and backward…
Classically, no information can be transmitted through a depolarising, that is a completely noisy, channel. We show that by combining a depolarising channel with another channel in an indefinite causal order---that is, when there is…
We consider the scenario in which Alice transmits private classical messages to Bob via a classical-quantum channel, part of whose output is intercepted by an eavesdropper, Eve. We prove the existence of a universal coding scheme under…
Pre-shared entanglement can significantly boost communication rates in the regime of high thermal noise, and a low-brightness transmitter. In this regime, the ratio between the entanglement-assisted capacity and the Holevo capacity, the…
We investigate how special relativity influences the transmission of classical information through quantum channels by evaluating the Holevo bound when the sender and the receiver are in (relativistic) relative motion. By using the spin…
We find a tight upper bound for the classical capacity of quantum thermal noise channels that is within $1/\ln 2$ bits of Holevo's lower bound. This lower bound is achievable using unentangled, classical signal states, namely displaced…
We give a capacity formula for the classical communication over a noisy quantum channel, when local operations and global permutations allowed in the encoding and bipartite states preshared between the sender and the receiver. The two…
We derive upper bounds on the rate of transmission of classical information over quantum channels by block codes with a given blocklength and error probability, for both entanglement-assisted and unassisted codes, in terms of a unifying…
Quantum communications promises reliable transmission of quantum information, efficient distribution of entanglement and generation of completely secure keys. For all these tasks, we need to determine the optimal point-to-point rates that…
In networks of mobile autonomous agents, e.g. for data acquisition, we may wish to maximize data transfer or to reliably transfer a minimum amount of data, subject to quality of service or energy constraints. These requirements can be…
The upper bound on the capacity of a 3-node discrete memoryless relay channel is considered, where a source X wants to send information to destination Y with the help of a relay Z. Y and Z are independent given X, and the link from Z to Y…
The amount of information that can be accessed via measurement of a quantum system prepared in different states is limited by the Kholevo bound. We present a simple proof of this theorem and its extension to sequential measurements based on…