2,106 research outputs found
On the Second-Order Asymptotics for Entanglement-Assisted Communication
The entanglement-assisted classical capacity of a quantum channel is known to
provide the formal quantum generalization of Shannon's classical channel
capacity theorem, in the sense that it admits a single-letter characterization
in terms of the quantum mutual information and does not increase in the
presence of a noiseless quantum feedback channel from receiver to sender. In
this work, we investigate second-order asymptotics of the entanglement-assisted
classical communication task. That is, we consider how quickly the rates of
entanglement-assisted codes converge to the entanglement-assisted classical
capacity of a channel as a function of the number of channel uses and the error
tolerance. We define a quantum generalization of the mutual information
variance of a channel in the entanglement-assisted setting. For covariant
channels, we show that this quantity is equal to the channel dispersion, and
thus completely characterize the convergence towards the entanglement-assisted
classical capacity when the number of channel uses increases. Our results also
apply to entanglement-assisted quantum communication, due to the equivalence
between entanglement-assisted classical and quantum communication established
by the teleportation and super-dense coding protocols.Comment: v2: Accepted for publication in Quantum Information Processin
Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities
This monograph presents a unified treatment of single- and multi-user
problems in Shannon's information theory where we depart from the requirement
that the error probability decays asymptotically in the blocklength. Instead,
the error probabilities for various problems are bounded above by a
non-vanishing constant and the spotlight is shone on achievable coding rates as
functions of the growing blocklengths. This represents the study of asymptotic
estimates with non-vanishing error probabilities.
In Part I, after reviewing the fundamentals of information theory, we discuss
Strassen's seminal result for binary hypothesis testing where the type-I error
probability is non-vanishing and the rate of decay of the type-II error
probability with growing number of independent observations is characterized.
In Part II, we use this basic hypothesis testing result to develop second- and
sometimes, even third-order asymptotic expansions for point-to-point
communication. Finally in Part III, we consider network information theory
problems for which the second-order asymptotics are known. These problems
include some classes of channels with random state, the multiple-encoder
distributed lossless source coding (Slepian-Wolf) problem and special cases of
the Gaussian interference and multiple-access channels. Finally, we discuss
avenues for further research.Comment: Further comments welcom
Second-order rate region of constant-composition codes for the multiple-access channel
This paper studies the second-order asymptotics of coding rates for the
discrete memoryless multiple-access channel with a fixed target error
probability. Using constant-composition random coding, coded time-sharing, and
a variant of Hoeffding's combinatorial central limit theorem, an inner bound on
the set of locally achievable second-order coding rates is given for each point
on the boundary of the capacity region. It is shown that the inner bound for
constant-composition random coding includes that recovered by i.i.d. random
coding, and that the inclusion may be strict. The inner bound is extended to
the Gaussian multiple-access channel via an increasingly fine quantization of
the inputs.Comment: (v2) Results/proofs given in matrix notation, det(V)=0 handled more
rigorously, Berry-Esseen derivation given. (v3) Gaussian case added (v4)
Significant change of presentation; added local dispersion results; added new
method to obtain non-standard tangent vector terms using coded time-sharing;
(v5) Final version (IEEE Transactions on Information Theory
Second-order coding rates for pure-loss bosonic channels
A pure-loss bosonic channel is a simple model for communication over
free-space or fiber-optic links. More generally, phase-insensitive bosonic
channels model other kinds of noise, such as thermalizing or amplifying
processes. Recent work has established the classical capacity of all of these
channels, and furthermore, it is now known that a strong converse theorem holds
for the classical capacity of these channels under a particular photon number
constraint. The goal of the present paper is to initiate the study of
second-order coding rates for these channels, by beginning with the simplest
one, the pure-loss bosonic channel. In a second-order analysis of
communication, one fixes the tolerable error probability and seeks to
understand the back-off from capacity for a sufficiently large yet finite
number of channel uses. We find a lower bound on the maximum achievable code
size for the pure-loss bosonic channel, in terms of the known expression for
its capacity and a quantity called channel dispersion. We accomplish this by
proving a general "one-shot" coding theorem for channels with classical inputs
and pure-state quantum outputs which reside in a separable Hilbert space. The
theorem leads to an optimal second-order characterization when the channel
output is finite-dimensional, and it remains an open question to determine
whether the characterization is optimal for the pure-loss bosonic channel.Comment: 18 pages, 3 figures; v3: final version accepted for publication in
Quantum Information Processin
- …