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

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

Bjarne Bergh, Robert Salzmann, Nilanjana Datta

Published Feb 1, 2021• 0 citations
OpenAlex

Related papers

Quantum Rényi Divergence

Marco Tomamichel

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

Investigating properties of a family of quantum Rényi divergences

Mingyan Simon Lin, Marco Tomamichel

arXiv:1408.6897•Quantum Information Processing•Feb 2, 2015•39 citations

Transformations on density operators and on positive definite operators preserving the quantum Rényi divergence

Marcell Gaál, Lajos Molnár

arXiv:1512.02490•Periodica Mathematica Hungarica•Nov 10, 2016•6 citations

Continuity of Regularized Channel Rényi Divergences

Jinzhao Wang, Yuxiang Yang

We prove that the regularized, stabilized sandwiched Rényi divergence of finite-dimensional quantum channels converges to their regularized relative entropy as the Rényi order tends to one. The key tool is the channel hockey-stick divergence: Gour's Stinespring approximation bound and a Schatten norm estimate amplify an asymptotic bound below one into exponential decay at higher threshold rates. For channel pairs with finite max-relative entropy, known operational connections then give exponential strong converses for parallel and adaptive discrimination, a sharp zero--one testing law, and the subchannel asymptotic equipartition property.

quant-pharXiv:2609.28635•Sep 25, 2026•1 citation

New quantum Rényi divergences and their application to device-independent cryptography and quantum Shannon theory

Peter J. Brown, Omar Fawzi, Hamza Fawzi

•Feb 1, 2021•0 citations

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
The α→1\alpha \to 1α→1 Limit of the Sharp Quantum Rényi Divergence
We prove that the regularized, stabilized sandwiched Rényi divergence of finite-dimensional quantum channels converges to their regularized relative entropy as the Rényi order tends to one. The key tool is the channel hockey-stick divergence: Gour's Stinespring approximation bound and a Schatten norm estimate amplify an asymptotic bound below one into exponential decay at higher threshold rates. For channel pairs with finite max-relative entropy, known operational connections then give exponential strong converses for parallel and adaptive discrimination, a sharp zero--one testing law, and the subchannel asymptotic equipartition property.
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.