Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1408.6897 · Quantum Information Processing

Investigating properties of a family of quantum Rényi divergences

Mingyan Simon Lin, Marco Tomamichel

Published Feb 2, 2015• 39 citations
arXivHTMLPDF
DOI
10.1007/s11128-015-0935-y

Related papers

Quantum Rényi Divergence

Marco Tomamichel

SpringerBriefs in mathematical physics•Oct 8, 2015•1 citation

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

Bjarne Bergh, Robert Salzmann, Nilanjana Datta

•Feb 1, 2021•0 citations

Quantum Rényi Divergence Satisfies Data Processing Inequality.

Salman Beigi

•Jun 25, 2013•7 citations

Reliability Functions of Quantum Soft Covering and Privacy Amplification via a Mixed-Order Rényi Divergence

Shi-Bing Li, Hongsen Qiu, Xinyu Zhang

In this paper, we introduce a novel mixed-order Rényi divergence and investigate its fundamental properties. Using this divergence, we define a family of mixed-order order-two Rényi mutual information and Rényi conditional entropy. We derive exact reliability functions of quantum soft covering and privacy amplification under the sandwiched Rényi divergence with order $α\in[2,\infty)$. The former is jointly characterized by the sandwiched and mixed-order order-two Rényi mutual information quantities, while the latter is characterized by the corresponding conditional entropies. These results provide operational interpretations of the proposed mixed-order Rényi divergence. To the best of our knowledge, this is the first exact characterization of the reliability function for quantum soft covering.

quant-pharXiv:2607.27015•Jul 30, 2026•1 citation

The α → 1 limit of the sharp quantum Rényi divergence

Bjarne Bergh, Robert Salzmann, Nilanjana Datta

Fawzi and Fawzi [Quantum 5, 387 (2021)] recently defined the sharp Rényi divergence, Dα#, for α ∈ (1, ∞), 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 α → 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 for which we prove various properties, including the data-processing inequality.

arXiv:2102.06576•Journal of Mathematical Physics•Sep 1, 2021•7 citations

Quantum Rényi and f-Divergences from Integral Representations

Christoph Hirche, Marco Tomamichel

arXiv:2306.12343•Communications in Mathematical Physics•Aug 20, 2024•48 citations
The α→1\alpha \to 1α→1 Limit of the Sharp Quantum Rényi Divergence
In this paper, we introduce a novel mixed-order Rényi divergence and investigate its fundamental properties. Using this divergence, we define a family of mixed-order order-two Rényi mutual information and Rényi conditional entropy. We derive exact reliability functions of quantum soft covering and privacy amplification under the sandwiched Rényi divergence with order α∈[2,∞)α\in[2,\infty)α∈[2,∞). The former is jointly characterized by the sandwiched and mixed-order order-two Rényi mutual information quantities, while the latter is characterized by the corresponding conditional entropies. These results provide operational interpretations of the proposed mixed-order Rényi divergence. To the best of our knowledge, this is the first exact characterization of the reliability function for quantum soft covering.
Fawzi and Fawzi [Quantum 5, 387 (2021)] recently defined the sharp Rényi divergence, Dα#, for α ∈ (1, ∞), 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 α → 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 for which we prove various properties, including the data-processing inequality.