The $\alpha \to 1$ Limit of the Sharp Quantum Rényi Divergence

Abstract

Fawzi and Fawzi recently defined the sharp Rényi divergence, $D_{\alpha }^{\#}$, for $\alpha \in (1,\infty )$, as an additional quantum Rényi divergence with nice mathematical properties and applications in quantum channel discrimination and quantum communication. One of their open questions was the limit $\alpha \to 1$ of this divergence. By finding a new expression of the sharp divergence in terms of a minimization of the geometric Rényi divergence, we show that this limit is equal to the Belavkin-Staszewski relative entropy. Analogous minimizations of arbitrary generalized divergences lead to a new family of generalized divergences that we call kringel divergences, and for which we prove various properties including the data-processing inequality.

arXiv comment11 pages, no figures. v3: Fixed a typo in Lemma 3 and simplified the argument in Lemma 11. v2: Restructured the proof of the main result and added clarifications to improve readability

References in corpus (8)

• On quantum Renyi entropies: a new generalization and some properties
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
• A Fully Quantum Asymptotic Equipartition Property
• Monotonicity of a relative Rényi entropy
• Different quantum f-divergences and the reversibility of quantum operations
• Principles of Quantum Communication Theory: A Modern Approach
• Geometric distinguishability measures limit quantum channel estimation and discrimination
• Defining quantum divergences via convex optimization

Cited by in corpus (2)

• Bounding the forward classical capacity of bipartite quantum channels
• Sufficiency of Rényi divergences