354 research outputs found

    Different quantum f-divergences and the reversibility of quantum operations

    Get PDF
    The concept of classical ff-divergences gives a unified framework to construct and study measures of dissimilarity of probability distributions; special cases include the relative entropy and the R\'enyi divergences. Various quantum versions of this concept, and more narrowly, the concept of R\'enyi divergences, have been introduced in the literature with applications in quantum information theory; most notably Petz' quasi-entropies (standard ff-divergences), Matsumoto's maximal ff-divergences, measured ff-divergences, and sandwiched and α\alpha-zz-R\'enyi divergences. In this paper we give a systematic overview of the various concepts of quantum ff-divergences with a main focus on their monotonicity under quantum operations, and the implications of the preservation of a quantum ff-divergence by a quantum operation. In particular, we compare the standard and the maximal ff-divergences regarding their ability to detect the reversibility of quantum operations. We also show that these two quantum ff-divergences are strictly different for non-commuting operators unless ff is a polynomial, and obtain some analogous partial results for the relation between the measured and the standard ff-divergences. We also study the monotonicity of the α\alpha-zz-R\'enyi divergences under the special class of bistochastic maps that leave one of the arguments of the R\'enyi divergence invariant, and determine domains of the parameters α,z\alpha,z where monotonicity holds, and where the preservation of the α\alpha-zz-R\'enyi divergence implies the reversibility of the quantum operation.Comment: 70 pages. v4: New Proposition 3.8 and Appendix D on the continuity properties of the standard f-divergences. The 2-positivity assumption removed from Theorem 3.34. The achievability of the measured f-divergence is shown in Proposition 4.17, and Theorem 4.18 is updated accordingl

    Divergence radii and the strong converse exponent of classical-quantum channel coding with constant compositions

    Get PDF
    There are different inequivalent ways to define the R\'enyi capacity of a channel for a fixed input distribution PP. In a 1995 paper Csisz\'ar has shown that for classical discrete memoryless channels there is a distinguished such quantity that has an operational interpretation as a generalized cutoff rate for constant composition channel coding. We show that the analogous notion of R\'enyi capacity, defined in terms of the sandwiched quantum R\'enyi divergences, has the same operational interpretation in the strong converse problem of classical-quantum channel coding. Denoting the constant composition strong converse exponent for a memoryless classical-quantum channel WW with composition PP and rate RR as sc(W,R,P)sc(W,R,P), our main result is that sc(W,R,P)=supα>1α1α[Rχα(W,P)], sc(W,R,P)=\sup_{\alpha>1}\frac{\alpha-1}{\alpha}\left[R-\chi_{\alpha}^*(W,P)\right], where χα(W,P)\chi_{\alpha}^*(W,P) is the PP-weighted sandwiched R\'enyi divergence radius of the image of the channel.Comment: 46 pages. V7: Added the strong converse exponent with cost constrain

    The structure of Renyi entropic inequalities

    Full text link
    We investigate the universal inequalities relating the alpha-Renyi entropies of the marginals of a multi-partite quantum state. This is in analogy to the same question for the Shannon and von Neumann entropy (alpha=1) which are known to satisfy several non-trivial inequalities such as strong subadditivity. Somewhat surprisingly, we find for 0<alpha<1, that the only inequality is non-negativity: In other words, any collection of non-negative numbers assigned to the nonempty subsets of n parties can be arbitrarily well approximated by the alpha-entropies of the 2^n-1 marginals of a quantum state. For alpha>1 we show analogously that there are no non-trivial homogeneous (in particular no linear) inequalities. On the other hand, it is known that there are further, non-linear and indeed non-homogeneous, inequalities delimiting the alpha-entropies of a general quantum state. Finally, we also treat the case of Renyi entropies restricted to classical states (i.e. probability distributions), which in addition to non-negativity are also subject to monotonicity. For alpha different from 0 and 1 we show that this is the only other homogeneous relation.Comment: 15 pages. v2: minor technical changes in Theorems 10 and 1

    Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication

    Get PDF
    This paper studies the difficulty of discriminating between an arbitrary quantum channel and a "replacer" channel that discards its input and replaces it with a fixed state. We show that, in this particular setting, the most general adaptive discrimination strategies provide no asymptotic advantage over non-adaptive tensor-power strategies. This conclusion follows by proving a quantum Stein's lemma for this channel discrimination setting, showing that a constant bound on the Type I error leads to the Type II error decreasing to zero exponentially quickly at a rate determined by the maximum relative entropy registered between the channels. The strong converse part of the lemma states that any attempt to make the Type II error decay to zero at a rate faster than the channel relative entropy implies that the Type I error necessarily converges to one. We then refine this latter result by identifying the optimal strong converse exponent for this task. As a consequence of these results, we can establish a strong converse theorem for the quantum-feedback-assisted capacity of a channel, sharpening a result due to Bowen. Furthermore, our channel discrimination result demonstrates the asymptotic optimality of a non-adaptive tensor-power strategy in the setting of quantum illumination, as was used in prior work on the topic. The sandwiched Renyi relative entropy is a key tool in our analysis. Finally, by combining our results with recent results of Hayashi and Tomamichel, we find a novel operational interpretation of the mutual information of a quantum channel N as the optimal type II error exponent when discriminating between a large number of independent instances of N and an arbitrary "worst-case" replacer channel chosen from the set of all replacer channels.Comment: v3: 35 pages, 4 figures, accepted for publication in Communications in Mathematical Physic
    corecore