190 research outputs found
A strong converse for classical channel coding using entangled inputs
A fully general strong converse for channel coding states that when the rate
of sending classical information exceeds the capacity of a quantum channel, the
probability of correctly decoding goes to zero exponentially in the number of
channel uses, even when we allow code states which are entangled across several
uses of the channel. Such a statement was previously only known for classical
channels and the quantum identity channel. By relating the problem to the
additivity of minimum output entropies, we show that a strong converse holds
for a large class of channels, including all unital qubit channels, the
d-dimensional depolarizing channel and the Werner-Holevo channel. This further
justifies the interpretation of the classical capacity as a sharp threshold for
information-transmission.Comment: 9 pages, revte
The invalidity of a strong capacity for a quantum channel with memory
The strong capacity of a particular channel can be interpreted as a sharp
limit on the amount of information which can be transmitted reliably over that
channel. To evaluate the strong capacity of a particular channel one must prove
both the direct part of the channel coding theorem and the strong converse for
the channel. Here we consider the strong converse theorem for the periodic
quantum channel and show some rather surprising results. We first show that the
strong converse does not hold in general for this channel and therefore the
channel does not have a strong capacity. Instead, we find that there is a scale
of capacities corresponding to error probabilities between integer multiples of
the inverse of the periodicity of the channel. A similar scale also exists for
the random channel.Comment: 7 pages, double column. Comments welcome. Repeated equation removed
and one reference adde
On Quantum Capacity of Compound Channels
In this paper we address the issue of universal or robust communication over
quantum channels. Specifically, we consider memoryless communication scenario
with channel uncertainty which is an analog of compound channel in classical
information theory. We determine the quantum capacity of finite compound
channels and arbitrary compound channels with informed decoder. Our approach in
the finite case is based on the observation that perfect channel knowledge at
the decoder does not increase the capacity of finite quantum compound channels.
As a consequence we obtain coding theorem for finite quantum averaged channels,
the simplest class of channels with long-term memory. The extension of these
results to quantum compound channels with uninformed encoder and decoder, and
infinitely many constituents remains an open problem.Comment: 16 pages, no figure
Iterative Approximate Consensus in the presence of Byzantine Link Failures
This paper explores the problem of reaching approximate consensus in
synchronous point-to-point networks, where each directed link of the underlying
communication graph represents a communication channel between a pair of nodes.
We adopt the transient Byzantine link failure model [15, 16], where an
omniscient adversary controls a subset of the directed communication links, but
the nodes are assumed to be fault-free.
Recent work has addressed the problem of reaching approximate consen- sus in
incomplete graphs with Byzantine nodes using a restricted class of iterative
algorithms that maintain only a small amount of memory across iterations [22,
21, 23, 12]. However, to the best of our knowledge, we are the first to
consider approximate consensus in the presence of Byzan- tine links. We extend
our past work that provided exact characterization of graphs in which the
iterative approximate consensus problem in the presence of Byzantine node
failures is solvable [22, 21]. In particular, we prove a tight necessary and
sufficient condition on the underlying com- munication graph for the existence
of iterative approximate consensus algorithms under transient Byzantine link
model. The condition answers (part of) the open problem stated in [16].Comment: arXiv admin note: text overlap with arXiv:1202.609
Asymptotic behaviour of random tridiagonal Markov chains in biological applications
Discrete-time discrete-state random Markov chains with a tridiagonal
generator are shown to have a random attractor consisting of singleton subsets,
essentially a random path, in the simplex of probability vectors. The proof
uses the Hilbert projection metric and the fact that the linear cocycle
generated by the Markov chain is a uniformly contractive mapping of the
positive cone into itself. The proof does not involve probabilistic properties
of the sample path and is thus equally valid in the nonautonomous deterministic
context of Markov chains with, say, periodically varying transitions
probabilities, in which case the attractor is a periodic path.Comment: 13 pages, 22 bibliography references, submitted to DCDS-B, added
references and minor correction
Uso del estadistico Dn de Kolmogorov-Smirnov en inferencia paramétrica
Se estudia un método de estimación paramétrica basado en la minimización del estadístico D n de Kolmogorov-Smirnov. Se prueba la existencia y unicidad de este estimador en familias de distribuciones monótonas en alguno de sus parámetros y se compara computacionalmente con el método de máxima verosimilitud
Entanglement transmission and generation under channel uncertainty: Universal quantum channel coding
We determine the optimal rates of universal quantum codes for entanglement
transmission and generation under channel uncertainty. In the simplest scenario
the sender and receiver are provided merely with the information that the
channel they use belongs to a given set of channels, so that they are forced to
use quantum codes that are reliable for the whole set of channels. This is
precisely the quantum analog of the compound channel coding problem. We
determine the entanglement transmission and entanglement-generating capacities
of compound quantum channels and show that they are equal. Moreover, we
investigate two variants of that basic scenario, namely the cases of informed
decoder or informed encoder, and derive corresponding capacity results.Comment: 45 pages, no figures. Section 6.2 rewritten due to an error in
equation (72) of the old version. Added table of contents, added section
'Conclusions and further remarks'. Accepted for publication in
'Communications in Mathematical Physics
- …