70,711 research outputs found
Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
A strong converse theorem for the classical capacity of a quantum channel
states that the probability of correctly decoding a classical message converges
exponentially fast to zero in the limit of many channel uses if the rate of
communication exceeds the classical capacity of the channel. Along with a
corresponding achievability statement for rates below the capacity, such a
strong converse theorem enhances our understanding of the capacity as a very
sharp dividing line between achievable and unachievable rates of communication.
Here, we show that such a strong converse theorem holds for the classical
capacity of all entanglement-breaking channels and all Hadamard channels (the
complementary channels of the former). These results follow by bounding the
success probability in terms of a "sandwiched" Renyi relative entropy, by
showing that this quantity is subadditive for all entanglement-breaking and
Hadamard channels, and by relating this quantity to the Holevo capacity. Prior
results regarding strong converse theorems for particular covariant channels
emerge as a special case of our results.Comment: 33 pages; v4: minor changes throughout, accepted for publication in
Communications in Mathematical Physic
Limits on Support Recovery with Probabilistic Models: An Information-Theoretic Framework
The support recovery problem consists of determining a sparse subset of a set
of variables that is relevant in generating a set of observations, and arises
in a diverse range of settings such as compressive sensing, and subset
selection in regression, and group testing. In this paper, we take a unified
approach to support recovery problems, considering general probabilistic models
relating a sparse data vector to an observation vector. We study the
information-theoretic limits of both exact and partial support recovery, taking
a novel approach motivated by thresholding techniques in channel coding. We
provide general achievability and converse bounds characterizing the trade-off
between the error probability and number of measurements, and we specialize
these to the linear, 1-bit, and group testing models. In several cases, our
bounds not only provide matching scaling laws in the necessary and sufficient
number of measurements, but also sharp thresholds with matching constant
factors. Our approach has several advantages over previous approaches: For the
achievability part, we obtain sharp thresholds under broader scalings of the
sparsity level and other parameters (e.g., signal-to-noise ratio) compared to
several previous works, and for the converse part, we not only provide
conditions under which the error probability fails to vanish, but also
conditions under which it tends to one.Comment: Accepted to IEEE Transactions on Information Theory; presented in
part at ISIT 2015 and SODA 201
Universal entanglement concentration
We propose a new protocol of \textit{universal} entanglement concentration,
which converts many copies of an \textit{unknown} pure state to an \textit{%
exact} maximally entangled state. The yield of the protocol, which is outputted
as a classical information, is probabilistic, and achives the entropy rate with
high probability, just as non-universal entanglement concentration protocols
do.
Our protocol is optimal among all similar protocols in terms of wide
varieties of measures either up to higher orders or non-asymptotically,
depending on the choice of the measure. The key of the proof of optimality is
the following fact, which is a consequence of the symmetry-based construction
of the protocol: For any invariant measures, optimal protocols are found out in
modifications of the protocol only in its classical output, or the claim on the
product.
We also observe that the classical part of the output of the protocol gives a
natural estimate of the entropy of entanglement, and prove that that estimate
achieves the better asymptotic performance than any other (potentially global)
measurements.Comment: Revised a lot, especially proofs, though no change in theorems,
lemmas itself. Very long, but essential part is from Sec.I to Sec IV-C. Some
of the appendces are almost independent of the main bod
Converses for Secret Key Agreement and Secure Computing
We consider information theoretic secret key agreement and secure function
computation by multiple parties observing correlated data, with access to an
interactive public communication channel. Our main result is an upper bound on
the secret key length, which is derived using a reduction of binary hypothesis
testing to multiparty secret key agreement. Building on this basic result, we
derive new converses for multiparty secret key agreement. Furthermore, we
derive converse results for the oblivious transfer problem and the bit
commitment problem by relating them to secret key agreement. Finally, we derive
a necessary condition for the feasibility of secure computation by trusted
parties that seek to compute a function of their collective data, using an
interactive public communication that by itself does not give away the value of
the function. In many cases, we strengthen and improve upon previously known
converse bounds. Our results are single-shot and use only the given joint
distribution of the correlated observations. For the case when the correlated
observations consist of independent and identically distributed (in time)
sequences, we derive strong versions of previously known converses
- …