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:2007.12576 · Quantum

Defining quantum divergences via convex optimization

Hamza Fawzi, Omar Fawzi

Published Jan 26, 2021• 49 citations
arXivHTMLPDF

Abstract

We introduce a new quantum Rényi divergence Dα# for α∈(1,∞) defined in terms of a convex optimization program. This divergence has several desirable computational and operational properties such as an efficient semidefinite programming representation for states and channels, and a chain rule property. An important property of this new divergence is that its regularization is equal to the sandwiched (also known as the minimal) quantum Rényi divergence. This allows us to prove several results. First, we use it to get a converging hierarchy of upper bounds on the regularized sandwiched α -Rényi divergence between quantum channels for α>1 . Second it allows us to prove a chain rule property for the sandwiched α -Rényi divergence for α>1 which we use to characterize the strong converse exponent for channel discrimination. Finally it allows us to get improved bounds on quantum channel capacities.

DOI
10.22331/q-2021-01-26-387

Related papers

Sandwiched Rényi divergence satisfies data processing inequality

Salman Beigi

Sandwiched (quantum) α-Rényi divergence has been recently defined in the independent works of Wilde et al. [“Strong converse for the classical capacity of entanglement-breaking channels,” preprint arXiv:1306.1586 (2013)] and Müller-Lennert et al. [“On quantum Rényi entropies: a new definition, some properties and several conjectures,” preprint arXiv:1306.3142v1 (2013)]. This new quantum divergence has already found applications in quantum information theory. Here we further investigate properties of this new quantum divergence. In particular, we show that sandwiched α-Rényi divergence satisfies the data processing inequality for all values of α > 1. Moreover we prove that α-Holevo information, a variant of Holevo information defined in terms of sandwiched α-Rényi divergence, is super-additive. Our results are based on Hölder's inequality, the Riesz-Thorin theorem and ideas from the theory of complex interpolation. We also employ Sion's minimax theorem.

arXiv:1306.5920•Journal of Mathematical Physics•Dec 1, 2013•286 citations

The Strong Converse Exponent of Discriminating Infinite-Dimensional Quantum States

Milán Mosonyi

Abstract The sandwiched Rényi divergences of two finite-dimensional density operators quantify their asymptotic distinguishability in the strong converse domain. This establishes the sandwiched Rényi divergences as the operationally relevant ones among the infinitely many quantum extensions of the classical Rényi divergences for Rényi parameter $$\alpha >1$$ α > 1 . The known proof of this goes by showing that the sandwiched Rényi divergence coincides with the regularized measured Rényi divergence, which in turn is proved by asymptotic pinching, a fundamentally finite-dimensional technique. Thus, while the notion of the sandwiched Rényi divergences was extended recently to density operators on an infinite-dimensional Hilbert space (in fact, even for states of an arbitrary von Neumann algebra), these quantities were so far lacking an operational interpretation similar to the finite-dimensional case, and it has also been open whether they coincide with the regularized measured Rényi divergences. In this paper we fill this gap by answering both questions in the positive for density operators on an infinite-dimensional Hilbert space, using a simple finite-dimensional approximation technique. We also initiate the study of the sandwiched Rényi divergences, and the related problem of the strong converse exponent, for pairs of positive semi-definite operators that are not necessarily trace-class (this corresponds to considering weights in a general von Neumann algebra setting). This is motivated by the need to define conditional Rényi entropies in the infinite-dimensional setting, while it might also be interesting from the purely mathematical point of view of extending the concept of Rényi (and other) divergences to settings beyond the standard one of positive trace-class operators (positive normal functionals in the von Neumann algebra setting). In this spirit, we also discuss the definition and some properties of the more general family of Rényi $$(\alpha ,z)$$ ( α , z ) -divergences of positive semi-definite operators on an infinite-dimensional separable Hilbert space.

arXiv:2107.08036•Communications in Mathematical Physics•Mar 10, 2023•15 citations

Some Continuity Properties of Quantum Rényi Divergences

Milán Mosonyi, Fumio Hiai

In the problem of binary quantum channel discrimination with product inputs, the supremum of all type II error exponents for which the optimal type I errors go to zero is equal to the Umegaki channel relative entropy, while the infimum of all type II error exponents for which the optimal type I errors go to one is equal to the infimum of the sandwiched channel Rényi$\alpha $-divergences over all$\alpha >1$. We prove the equality of these two threshold values (and therefore the strong converse property for this problem) using a minimax argument based on a newly established continuity property of the sandwiched Rényi divergences. Motivated by this, we give a detailed analysis of the continuity properties of various other quantum (channel) Rényi divergences, which may be of independent interest.

arXiv:2209.00646•IEEE Transactions on Information Theory•Oct 16, 2023•20 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

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

Geometric Rényi Divergence and its Applications in Quantum Channel Capacities

Kun Fang, Hamza Fawzi

Abstract Having a distance measure between quantum states satisfying the right properties is of fundamental importance in all areas of quantum information. In this work, we present a systematic study of the geometric Rényi divergence (GRD), also known as the maximal Rényi divergence, from the point of view of quantum information theory. We show that this divergence, together with its extension to channels, has many appealing structural properties, which are not satisfied by other quantum Rényi divergences. For example we prove a chain rule inequality that immediately implies the “amortization collapse” for the geometric Rényi divergence, addressing an open question by Berta et al. [Letters in Mathematical Physics 110:2277–2336, 2020, Equation (55)] in the area of quantum channel discrimination. As applications, we explore various channel capacity problems and construct new channel information measures based on the geometric Rényi divergence, sharpening the previously best-known bounds based on the max-relative entropy while still keeping the new bounds single-letter and efficiently computable. A plethora of examples are investigated and the improvements are evident for almost all cases.

arXiv:1909.05758•Communications in Mathematical Physics•May 24, 2021•89 citations
We introduce a new quantum Rényi divergence Dα# for α∈(1,∞) defined in terms of a convex optimization program. This divergence has several desirable computational and operational properties such as an efficient semidefinite programming representation for states and channels, and a chain rule property. An important property of this new divergence is that its regularization is equal to the sandwiched (also known as the minimal) quantum Rényi divergence. This allows us to prove several results. First, we use it to get a converging hierarchy of upper bounds on the regularized sandwiched α -Rényi divergence between quantum channels for α>1 . Second it allows us to prove a chain rule property for the sandwiched α -Rényi divergence for α>1 which we use to characterize the strong converse exponent for channel discrimination. Finally it allows us to get improved bounds on quantum channel capacities.
Sandwiched (quantum) α-Rényi divergence has been recently defined in the independent works of Wilde et al. [“Strong converse for the classical capacity of entanglement-breaking channels,” preprint arXiv:1306.1586 (2013)] and Müller-Lennert et al. [“On quantum Rényi entropies: a new definition, some properties and several conjectures,” preprint arXiv:1306.3142v1 (2013)]. This new quantum divergence has already found applications in quantum information theory. Here we further investigate properties of this new quantum divergence. In particular, we show that sandwiched α-Rényi divergence satisfies the data processing inequality for all values of α > 1. Moreover we prove that α-Holevo information, a variant of Holevo information defined in terms of sandwiched α-Rényi divergence, is super-additive. Our results are based on Hölder's inequality, the Riesz-Thorin theorem and ideas from the theory of complex interpolation. We also employ Sion's minimax theorem.
Abstract The sandwiched Rényi divergences of two finite-dimensional density operators quantify their asymptotic distinguishability in the strong converse domain. This establishes the sandwiched Rényi divergences as the operationally relevant ones among the infinitely many quantum extensions of the classical Rényi divergences for Rényi parameter α>1\alpha >1α>1 α > 1 . The known proof of this goes by showing that the sandwiched Rényi divergence coincides with the regularized measured Rényi divergence, which in turn is proved by asymptotic pinching, a fundamentally finite-dimensional technique. Thus, while the notion of the sandwiched Rényi divergences was extended recently to density operators on an infinite-dimensional Hilbert space (in fact, even for states of an arbitrary von Neumann algebra), these quantities were so far lacking an operational interpretation similar to the finite-dimensional case, and it has also been open whether they coincide with the regularized measured Rényi divergences. In this paper we fill this gap by answering both questions in the positive for density operators on an infinite-dimensional Hilbert space, using a simple finite-dimensional approximation technique. We also initiate the study of the sandwiched Rényi divergences, and the related problem of the strong converse exponent, for pairs of positive semi-definite operators that are not necessarily trace-class (this corresponds to considering weights in a general von Neumann algebra setting). This is motivated by the need to define conditional Rényi entropies in the infinite-dimensional setting, while it might also be interesting from the purely mathematical point of view of extending the concept of Rényi (and other) divergences to settings beyond the standard one of positive trace-class operators (positive normal functionals in the von Neumann algebra setting). In this spirit, we also discuss the definition and some properties of the more general family of Rényi (α,z)(\alpha ,z)(α,z) ( α , z ) -divergences of positive semi-definite operators on an infinite-dimensional separable Hilbert space.
In the problem of binary quantum channel discrimination with product inputs, the supremum of all type II error exponents for which the optimal type I errors go to zero is equal to the Umegaki channel relative entropy, while the infimum of all type II error exponents for which the optimal type I errors go to one is equal to the infimum of the sandwiched channel Rényi$\alpha −divergencesoverall-divergences over all−divergencesoverall\alpha >1$. We prove the equality of these two threshold values (and therefore the strong converse property for this problem) using a minimax argument based on a newly established continuity property of the sandwiched Rényi divergences. Motivated by this, we give a detailed analysis of the continuity properties of various other quantum (channel) Rényi divergences, which may be of independent interest.
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.
Abstract Having a distance measure between quantum states satisfying the right properties is of fundamental importance in all areas of quantum information. In this work, we present a systematic study of the geometric Rényi divergence (GRD), also known as the maximal Rényi divergence, from the point of view of quantum information theory. We show that this divergence, together with its extension to channels, has many appealing structural properties, which are not satisfied by other quantum Rényi divergences. For example we prove a chain rule inequality that immediately implies the “amortization collapse” for the geometric Rényi divergence, addressing an open question by Berta et al. [Letters in Mathematical Physics 110:2277–2336, 2020, Equation (55)] in the area of quantum channel discrimination. As applications, we explore various channel capacity problems and construct new channel information measures based on the geometric Rényi divergence, sharpening the previously best-known bounds based on the max-relative entropy while still keeping the new bounds single-letter and efficiently computable. A plethora of examples are investigated and the improvements are evident for almost all cases.