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:2308.12425 · Annales Henri Poincaré

Unified Framework for Continuity of Sandwiched Rényi Divergences

Andreas Blühm, Ángela Capel, Paul Gondolf, Tim Möbus

Published Dec 26, 2024• 3 citations
arXivHTMLPDF

Abstract

Abstract In this work, we prove uniform continuity bounds for entropic quantities related to the sandwiched Rényi divergences such as the sandwiched Rényi conditional entropy. We follow three different approaches: The first one is the “almost additive approach”, which exploits the sub-/superadditivity and joint concavity/convexity of the exponential of the divergence. In our second approach, termed the “operator space approach”, we express the entropic measures as norms and utilize their properties for establishing the bounds. These norms draw inspiration from interpolation space norms. We not only demonstrate the norm properties solely relying on matrix analysis tools but also extend their applicability to a context that holds relevance in resource theories. By this, we extend the strategies of Marwah and Dupuis as well as Beigi and Goodarzi employed in the sandwiched Rényi conditional entropy context. Finally, we merge the approaches into a mixed approach that has some advantageous properties and then discuss in which regimes each bound performs best. Our results improve over the previous best continuity bounds or sometimes even give the first continuity bounds available. In a separate contribution, we use the ALAFF method, developed in a previous article by some of the authors, to study the stability of approximate quantum Markov chains.

DOI
10.1007/s00023-024-01519-x

Related papers

Rényi divergence inequalities via interpolation, with applications to generalised entropic uncertainty relations

Alexander Clyde McKinlay

We investigate quantum Rényi entropic quantities, specifically those derived from 'sandwiched' divergence. This divergence is one of several proposed Rényi generalisations of the quantum relative entropy. We may define Rényi generalisations of the quantum conditional entropy and mutual information in terms of this divergence, from which they inherit many desirable properties. However, these quantities lack some of the convenient structure of their Shannon and von Neumann counterparts. We attempt to bridge this gap by establishing divergence inequalities for valid combinations of Rényi order which replicate the chain and decomposition rules of Shannon and von Neumann entropies. Although weaker in general, these inequalities recover equivalence when the Rényi parameters tend to one. To this end we present Rényi mutual information decomposition rules, a new approach to the Rényi conditional entropy tripartite chain rules and a more general bipartite comparison. The derivation of these results relies on a novel complex interpolation approach for general spaces of linear operators. These new comparisons allow us to employ techniques that until now were only available for Shannon and von Neumann entropies. We can therefore directly apply them to the derivation of Rényi entropic uncertainty relations. Accordingly, we establish a family of Rényi information exclusion relations and provide further generalisations and improvements to this and other known relations, including the Rényi bipartite uncertainty relations.

arXiv:2106.10415•Jun 19, 2021•0 citations

Continuity inequalities for sandwiched Rényi and Tsallis conditional entropies with application to the channel entropy continuity

Anna Vershynina

For the sandwiched Rényi entropy the conditional entropy can be defined two ways: $\widetilde{H}^\downarrow_α(A|B)_ρ, \widetilde{H}^\uparrow_α(A|B)_ρ$. In the limiting case, $α=1$, both definitions consolidate into conditional entropy $H(A|B)=S(AB)-S(B)$. The continuity inequality for conditional entropy $H(A|B)$, called the Alicki-Fannes-Winter (AWF) inequality, shows that if the states are close in trace-distance, then the conditional entropies are also close. Having the AWF inequality for conditional entropy, we show that the channel entropy defined through the relative entropy is continuous with respect to the diamond-distance between channels. Inspired by this, similar continuity inequalities for the Rényi conditional entropy $\widetilde{H}^\uparrow_α$ were obtained in the work [A. Marwah and F. Dupuis, J. Math. Phys. 63, 052201 (2022)]. We provide continuity bounds for the sandwiched Rényi and Tsallis conditional entropies $\widetilde{H}^\downarrow_α(A|B)_ρ, \widetilde{T}^\downarrow_α(A|B)_ρ$ for states with the same marginal on the conditioning system. Similar to the previous bounds, our bound depends only on the dimension of the conditioning system. We apply this result to prove continuity of the channel entropy for Rényi and Tsallis channel entropies defined through the sandwiched Rényi and Tsallis relative entropies.

math-phCross-listedarXiv:2512.01745•Journal of Mathematical Physics•Dec 2, 2025•0 citations

Fully quantum fidelity-based entropic continuity bounds

Matthew Simon Tan, Ernest Y. -Z. Tan

We present a continuity bound for quantum conditional entropies in terms of fidelity, with no dependence on the dimension of the conditioning system. Our results encompass both the von Neumann entropy and one version of sandwiched Rényi entropy, which is particularly relevant for applications in quantum key distribution (QKD). In such applications, this bound should provide improved results as compared to previous continuity bounds based on trace distance. We also show that the bounds can be sharpened as expected for classical-quantum states, and verify that they hold when the conditioning system has countably infinite dimension. Finally, we present several variants tailored for exponential functions of the Rényi entropies instead, which should be relevant for QKD applications.

quant-pharXiv:2610.25299•Oct 20, 2026•0 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•0 citations

Sharp Continuity of Petz and Sandwiched Rényi Conditional Entropies

Hao-Chung Cheng, Po-Chieh Liu

We determine the sharp modulus of continuity, in trace distance, of the optimized Petz and sandwiched Rényi conditional entropies for every order $α\in[\frac12,1)$. If two bipartite states are within trace distance $δ$, then both conditional entropies differ by at most $\frac{1}{1-α} \log[(1-\varepsilon)^α +(D-1)^{1-α}\varepsilon^α]$, where $\varepsilon := \min\{δ,1-1/D\}$ and $D$ is the effective dimension, given by the dimension of the first subsystem times the largest possible Schmidt rank. For every distance constraint $δ\in[0,1]$, the bound is attained by an isotropic pair with a maximally entangled anchor. Taking $α\uparrow1$ recovers the recent sharp continuity bound of quantum conditional entropy by Berta et al. [arXiv:2607.24687]. The proof linearizes the relevant concave Rényi functional at a comparison point dictated by the isotropic equality family. Schmidt-rank domination extends the equality geometry to an arbitrary anchor state, after which trace-distance duality and a noncommutative calibration estimate control the perturbation and anchor term without weakening the sharp constant. The latter estimate requires matrix analysis and is assisted by ChatGPT 5.6 Sol.

quant-pharXiv:2608.04947•Aug 6, 2026•0 citations

Continuity of Quantum Entropic Quantities via Almost Convexity

Andreas Blühm, Ángela Capel, Paul Gondolf +1 more

Based on the proofs of the continuity of the conditional entropy by Alicki, Fannes, and Winter, we introduce in this work the almost locally affine (ALAFF) method. This method allows us to prove a great variety of continuity bounds for the derived entropic quantities. First, we apply the ALAFF method to the Umegaki relative entropy. This way, we recover known almost tight bounds, but also some new continuity bounds for the relative entropy. Subsequently, we apply our method to the Belavkin-Staszewski relative entropy (BS-entropy). This yields novel explicit bounds in particular for the BS-conditional entropy, the BS-mutual and BS-conditional mutual information. On the way, we prove almost concavity for the Umegaki relative entropy and the BS-entropy, which might be of independent interest. We conclude by showing some applications of these continuity bounds in various contexts within quantum information theory.

arXiv:2208.00922•IEEE Transactions on Information Theory•May 19, 2023•21 citations
Abstract In this work, we prove uniform continuity bounds for entropic quantities related to the sandwiched Rényi divergences such as the sandwiched Rényi conditional entropy. We follow three different approaches: The first one is the “almost additive approach”, which exploits the sub-/superadditivity and joint concavity/convexity of the exponential of the divergence. In our second approach, termed the “operator space approach”, we express the entropic measures as norms and utilize their properties for establishing the bounds. These norms draw inspiration from interpolation space norms. We not only demonstrate the norm properties solely relying on matrix analysis tools but also extend their applicability to a context that holds relevance in resource theories. By this, we extend the strategies of Marwah and Dupuis as well as Beigi and Goodarzi employed in the sandwiched Rényi conditional entropy context. Finally, we merge the approaches into a mixed approach that has some advantageous properties and then discuss in which regimes each bound performs best. Our results improve over the previous best continuity bounds or sometimes even give the first continuity bounds available. In a separate contribution, we use the ALAFF method, developed in a previous article by some of the authors, to study the stability of approximate quantum Markov chains.
We investigate quantum Rényi entropic quantities, specifically those derived from 'sandwiched' divergence. This divergence is one of several proposed Rényi generalisations of the quantum relative entropy. We may define Rényi generalisations of the quantum conditional entropy and mutual information in terms of this divergence, from which they inherit many desirable properties. However, these quantities lack some of the convenient structure of their Shannon and von Neumann counterparts. We attempt to bridge this gap by establishing divergence inequalities for valid combinations of Rényi order which replicate the chain and decomposition rules of Shannon and von Neumann entropies. Although weaker in general, these inequalities recover equivalence when the Rényi parameters tend to one. To this end we present Rényi mutual information decomposition rules, a new approach to the Rényi conditional entropy tripartite chain rules and a more general bipartite comparison. The derivation of these results relies on a novel complex interpolation approach for general spaces of linear operators. These new comparisons allow us to employ techniques that until now were only available for Shannon and von Neumann entropies. We can therefore directly apply them to the derivation of Rényi entropic uncertainty relations. Accordingly, we establish a family of Rényi information exclusion relations and provide further generalisations and improvements to this and other known relations, including the Rényi bipartite uncertainty relations.
For the sandwiched Rényi entropy the conditional entropy can be defined two ways: H~α↓(A∣B)ρ,H~α↑(A∣B)ρ\widetilde{H}^\downarrow_α(A|B)_ρ, \widetilde{H}^\uparrow_α(A|B)_ρHα↓​(A∣B)ρ​,Hα↑​(A∣B)ρ​. In the limiting case, α=1α=1α=1, both definitions consolidate into conditional entropy H(A∣B)=S(AB)−S(B)H(A|B)=S(AB)-S(B)H(A∣B)=S(AB)−S(B). The continuity inequality for conditional entropy H(A∣B)H(A|B)H(A∣B), called the Alicki-Fannes-Winter (AWF) inequality, shows that if the states are close in trace-distance, then the conditional entropies are also close. Having the AWF inequality for conditional entropy, we show that the channel entropy defined through the relative entropy is continuous with respect to the diamond-distance between channels. Inspired by this, similar continuity inequalities for the Rényi conditional entropy H~α↑\widetilde{H}^\uparrow_αHα↑​ were obtained in the work [A. Marwah and F. Dupuis, J. Math. Phys. 63, 052201 (2022)]. We provide continuity bounds for the sandwiched Rényi and Tsallis conditional entropies H~α↓(A∣B)ρ,T~α↓(A∣B)ρ\widetilde{H}^\downarrow_α(A|B)_ρ, \widetilde{T}^\downarrow_α(A|B)_ρHα↓​(A∣B)ρ​,Tα↓​(A∣B)ρ​ for states with the same marginal on the conditioning system. Similar to the previous bounds, our bound depends only on the dimension of the conditioning system. We apply this result to prove continuity of the channel entropy for Rényi and Tsallis channel entropies defined through the sandwiched Rényi and Tsallis relative entropies.
We present a continuity bound for quantum conditional entropies in terms of fidelity, with no dependence on the dimension of the conditioning system. Our results encompass both the von Neumann entropy and one version of sandwiched Rényi entropy, which is particularly relevant for applications in quantum key distribution (QKD). In such applications, this bound should provide improved results as compared to previous continuity bounds based on trace distance. We also show that the bounds can be sharpened as expected for classical-quantum states, and verify that they hold when the conditioning system has countably infinite dimension. Finally, we present several variants tailored for exponential functions of the Rényi entropies instead, which should be relevant for QKD applications.
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.
We determine the sharp modulus of continuity, in trace distance, of the optimized Petz and sandwiched Rényi conditional entropies for every order α∈[12,1)α\in[\frac12,1)α∈[21​,1). If two bipartite states are within trace distance δδδ, then both conditional entropies differ by at most 11−αlog⁡[(1−ε)α+(D−1)1−αεα]\frac{1}{1-α} \log[(1-\varepsilon)^α +(D-1)^{1-α}\varepsilon^α]1−α1​log[(1−ε)α+(D−1)1−αεα], where ε:=min⁡{δ,1−1/D}\varepsilon := \min\{δ,1-1/D\}ε:=min{δ,1−1/D} and DDD is the effective dimension, given by the dimension of the first subsystem times the largest possible Schmidt rank. For every distance constraint δ∈[0,1]δ\in[0,1]δ∈[0,1], the bound is attained by an isotropic pair with a maximally entangled anchor. Taking α↑1α\uparrow1α↑1 recovers the recent sharp continuity bound of quantum conditional entropy by Berta et al. [arXiv:2607.24687]. The proof linearizes the relevant concave Rényi functional at a comparison point dictated by the isotropic equality family. Schmidt-rank domination extends the equality geometry to an arbitrary anchor state, after which trace-distance duality and a noncommutative calibration estimate control the perturbation and anchor term without weakening the sharp constant. The latter estimate requires matrix analysis and is assisted by ChatGPT 5.6 Sol.
Based on the proofs of the continuity of the conditional entropy by Alicki, Fannes, and Winter, we introduce in this work the almost locally affine (ALAFF) method. This method allows us to prove a great variety of continuity bounds for the derived entropic quantities. First, we apply the ALAFF method to the Umegaki relative entropy. This way, we recover known almost tight bounds, but also some new continuity bounds for the relative entropy. Subsequently, we apply our method to the Belavkin-Staszewski relative entropy (BS-entropy). This yields novel explicit bounds in particular for the BS-conditional entropy, the BS-mutual and BS-conditional mutual information. On the way, we prove almost concavity for the Umegaki relative entropy and the BS-entropy, which might be of independent interest. We conclude by showing some applications of these continuity bounds in various contexts within quantum information theory.