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:1806.03985 · Journal of Physics A Mathematical and Theoretical

Inequalities for quantum divergences and the Audenaert–Datta conjecture

Eric A. Carlen, Rupert L. Frank, Élliott H. Lieb

Published Oct 16, 2018• 34 citations
arXivHTMLPDF

Abstract

Abstract Given two density matrices ρ and σ , there are a number of different expressions that reduce to the α -Rényi relative entropy of ρ with respect to σ in the classical case; i.e. when ρ and σ commute. Only those expressions for which the data processing inequality (DPI) is valid are of potential interest as quantum divergences in quantum information theory. Audenaert and Datta have made a conjecture on the validity of the DPI for an interesting family of quantum generalizations of the α -Rényi relative entropies, the -Rényi relative entropies. They and others have contributed to the partial solution of this conjecture. We review the problem, its context, and the methods that have been used to obtain the results that are known at present, presenting a unified treatment of developments that have unfolded in a number of different papers.

DOI
10.1088/1751-8121/aae8a3

Related papers

α - z -Rényi relative entropies

Koenraad M. R. Audenaert, Nilanjana Datta

We consider a two-parameter family of Rényi relative entropies Dα,z(ρ ∥ σ) that are quantum generalisations of the classical Rényi divergence Dα(p ∥ q). This family includes many known relative entropies (or divergences) such as the quantum relative entropy, the recently defined quantum Rényi divergences, as well as the quantum Rényi relative entropies. All its members satisfy the quantum generalizations of Rényi’s axioms for a divergence. We consider the range of the parameters α, z for which the data-processing inequality holds. We also investigate a variety of limiting cases for the two parameters, obtaining explicit formulas for each one of them.

arXiv:1310.7178•Journal of Mathematical Physics•Feb 1, 2015•158 citations

Optimized quantum f -divergences and data processing

Mark M. Wilde

Abstract The quantum relative entropy is a measure of the distinguishability of two quantum states, and it is a unifying concept in quantum information theory: many information measures such as entropy, conditional entropy, mutual information, and entanglement measures can be realized from it. As such, there has been broad interest in generalizing the notion to further understand its most basic properties, one of which is the data processing inequality. The quantum f -divergence of Petz is one generalization of the quantum relative entropy, and it also leads to other relative entropies, such as the Petz–Rényi relative entropies. In this paper, I introduce the optimized quantum f -divergence as a related generalization of quantum relative entropy. I prove that it satisfies the data processing inequality, and the method of proof relies upon the operator Jensen inequality, similar to Petz’s original approach. Interestingly, the sandwiched Rényi relative entropies are particular examples of the optimized f -divergence. Thus, one benefit of this paper is that there is now a single, unified approach for establishing the data processing inequality for both the Petz–Rényi and sandwiched Rényi relative entropies, for the full range of parameters for which it is known to hold. This paper discusses other aspects of the optimized f -divergence, such as the classical case, the classical-quantum case, and how to construct optimized f -information measures.

arXiv:1710.10252•Journal of Physics A Mathematical and Theoretical•Jul 25, 2018•53 citations

Equality conditions of data processing inequality forα-zRényi relative entropies

Haonan Zhang

The α–z Rényi relative entropies are a two-parameter family of Rényi relative entropies that are quantum generalizations of the classical α-Rényi relative entropies. In the work [Adv. Math. 365, 107053 (2020)], we decided the full range of (α, z) for which the data processing inequality (DPI) is valid. In this paper, we give algebraic conditions for the equality in DPI. For the full range of parameters (α, z), we give necessary conditions and sufficient conditions. For most parameters, we give equivalent conditions. This generalizes and strengthens the results of Leditzky et al. [Lett. Math. Phys. 107, 61–80 (2017)].

arXiv:2007.06644•Journal of Mathematical Physics•Oct 1, 2020•12 citations

Optimized Quantum F-Divergences

Mark M. Wilde

The quantum relative entropy is a measure of the distinguishability of two quantum states, and it is a unifying concept in quantum information theory: many information measures such as entropy, conditional entropy, mutual information, and entanglement measures can be realized from it. As such, there has been broad interest in generalizing the notion to further understand its most basic properties, one of which is the data processing inequality. The quantum f-divergence of Petz is one generalization of the quantum relative entropy, and it also leads to other relative entropies, such as the Petz-Renyi relative entropies. In this contribution, I introduce the optimized quantum f-divergence as a related generalization of quantum relative entropy. I prove that it satisfies the data processing inequality, and the method of proof relies upon the operator Jensen inequality, similar to Petz's original approach. Interestingly, the sandwiched Renyi relative entropies are particular examples of the optimized f-divergence. Thus, one benefit of this approach is that there is now a single, unified approach for establishing the data processing inequality for both the Petz-Renyi and sandwiched Renyi relative entropies, for the full range of parameters for which it is known to hold. Full version of this paper is accessible at arXiv:1710.10252

arXiv:2103.16797•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2018•1 citation

A limit of the quantum Rényi divergence

Nilanjana Datta, Felix Leditzky

Recently, an interesting quantity called the quantum Rényi divergence (or 'sandwiched' Rényi relative entropy) was defined for pairs of positive semi-definite operators ρ and σ. It depends on a parameter α and acts as a parent quantity for other relative entropies which have important operational significance in quantum information theory: the quantum relative entropy and the min- and max-relative entropies. There is, however, another relative entropy, called the 0-relative Rényi entropy, which plays a key role in the analysis of various quantum information-processing tasks in the one-shot setting. We prove that the 0-relative Rényi entropy is obtainable from the quantum Rényi divergence only if ρ and σ have equal supports. This, along with existing results in the literature, suggests that it suffices to consider two essential parent quantities from which operationally relevant entropic quantities can be derived—the quantum Rényi divergence with parameter α ⩾ 1/2, and the α-relative Rényi entropy with α ∈ [0, 1).

arXiv:1308.5961•Journal of Physics A Mathematical and Theoretical•Jan 8, 2014•53 citations

Tensorization of the strong data processing inequality for quantum chi-square divergences

Yu Hua Cao, Jianfeng Lu

It is well-known that any quantum channel E satisfies the data processing inequality (DPI), with respect to various divergences, e.g., quantum χκ2 divergences and quantum relative entropy. More specifically, the data processing inequality states that the divergence between two arbitrary quantum states ρ and σ does not increase under the action of any quantum channel E . For a fixed channel E and a state σ , the divergence between output states E(ρ) and E(σ) might be strictly smaller than the divergence between input states ρ and σ , which is characterized by the strong data processing inequality (SDPI). Among various input states ρ , the largest value of the rate of contraction is known as the SDPI constant. An important and widely studied property for classical channels is that SDPI constants tensorize. In this paper, we extend the tensorization property to the quantum regime: we establish the tensorization of SDPIs for the quantum χκ1/22 divergence for arbitrary quantum channels and also for a family of χκ2 divergences (with κ≥κ1/2 ) for arbitrary quantum-classical channels.

arXiv:1904.06562•Quantum•Oct 28, 2019•5 citations
Abstract Given two density matrices ρ and σ , there are a number of different expressions that reduce to the α -Rényi relative entropy of ρ with respect to σ in the classical case; i.e. when ρ and σ commute. Only those expressions for which the data processing inequality (DPI) is valid are of potential interest as quantum divergences in quantum information theory. Audenaert and Datta have made a conjecture on the validity of the DPI for an interesting family of quantum generalizations of the α -Rényi relative entropies, the -Rényi relative entropies. They and others have contributed to the partial solution of this conjecture. We review the problem, its context, and the methods that have been used to obtain the results that are known at present, presenting a unified treatment of developments that have unfolded in a number of different papers.
We consider a two-parameter family of Rényi relative entropies Dα,z(ρ ∥ σ) that are quantum generalisations of the classical Rényi divergence Dα(p ∥ q). This family includes many known relative entropies (or divergences) such as the quantum relative entropy, the recently defined quantum Rényi divergences, as well as the quantum Rényi relative entropies. All its members satisfy the quantum generalizations of Rényi’s axioms for a divergence. We consider the range of the parameters α, z for which the data-processing inequality holds. We also investigate a variety of limiting cases for the two parameters, obtaining explicit formulas for each one of them.
Abstract The quantum relative entropy is a measure of the distinguishability of two quantum states, and it is a unifying concept in quantum information theory: many information measures such as entropy, conditional entropy, mutual information, and entanglement measures can be realized from it. As such, there has been broad interest in generalizing the notion to further understand its most basic properties, one of which is the data processing inequality. The quantum f -divergence of Petz is one generalization of the quantum relative entropy, and it also leads to other relative entropies, such as the Petz–Rényi relative entropies. In this paper, I introduce the optimized quantum f -divergence as a related generalization of quantum relative entropy. I prove that it satisfies the data processing inequality, and the method of proof relies upon the operator Jensen inequality, similar to Petz’s original approach. Interestingly, the sandwiched Rényi relative entropies are particular examples of the optimized f -divergence. Thus, one benefit of this paper is that there is now a single, unified approach for establishing the data processing inequality for both the Petz–Rényi and sandwiched Rényi relative entropies, for the full range of parameters for which it is known to hold. This paper discusses other aspects of the optimized f -divergence, such as the classical case, the classical-quantum case, and how to construct optimized f -information measures.
The α–z Rényi relative entropies are a two-parameter family of Rényi relative entropies that are quantum generalizations of the classical α-Rényi relative entropies. In the work [Adv. Math. 365, 107053 (2020)], we decided the full range of (α, z) for which the data processing inequality (DPI) is valid. In this paper, we give algebraic conditions for the equality in DPI. For the full range of parameters (α, z), we give necessary conditions and sufficient conditions. For most parameters, we give equivalent conditions. This generalizes and strengthens the results of Leditzky et al. [Lett. Math. Phys. 107, 61–80 (2017)].
The quantum relative entropy is a measure of the distinguishability of two quantum states, and it is a unifying concept in quantum information theory: many information measures such as entropy, conditional entropy, mutual information, and entanglement measures can be realized from it. As such, there has been broad interest in generalizing the notion to further understand its most basic properties, one of which is the data processing inequality. The quantum f-divergence of Petz is one generalization of the quantum relative entropy, and it also leads to other relative entropies, such as the Petz-Renyi relative entropies. In this contribution, I introduce the optimized quantum f-divergence as a related generalization of quantum relative entropy. I prove that it satisfies the data processing inequality, and the method of proof relies upon the operator Jensen inequality, similar to Petz's original approach. Interestingly, the sandwiched Renyi relative entropies are particular examples of the optimized f-divergence. Thus, one benefit of this approach is that there is now a single, unified approach for establishing the data processing inequality for both the Petz-Renyi and sandwiched Renyi relative entropies, for the full range of parameters for which it is known to hold. Full version of this paper is accessible at arXiv:1710.10252
Recently, an interesting quantity called the quantum Rényi divergence (or 'sandwiched' Rényi relative entropy) was defined for pairs of positive semi-definite operators ρ and σ. It depends on a parameter α and acts as a parent quantity for other relative entropies which have important operational significance in quantum information theory: the quantum relative entropy and the min- and max-relative entropies. There is, however, another relative entropy, called the 0-relative Rényi entropy, which plays a key role in the analysis of various quantum information-processing tasks in the one-shot setting. We prove that the 0-relative Rényi entropy is obtainable from the quantum Rényi divergence only if ρ and σ have equal supports. This, along with existing results in the literature, suggests that it suffices to consider two essential parent quantities from which operationally relevant entropic quantities can be derived—the quantum Rényi divergence with parameter α ⩾ 1/2, and the α-relative Rényi entropy with α ∈ [0, 1).
It is well-known that any quantum channel E satisfies the data processing inequality (DPI), with respect to various divergences, e.g., quantum χκ2 divergences and quantum relative entropy. More specifically, the data processing inequality states that the divergence between two arbitrary quantum states ρ and σ does not increase under the action of any quantum channel E . For a fixed channel E and a state σ , the divergence between output states E(ρ) and E(σ) might be strictly smaller than the divergence between input states ρ and σ , which is characterized by the strong data processing inequality (SDPI). Among various input states ρ , the largest value of the rate of contraction is known as the SDPI constant. An important and widely studied property for classical channels is that SDPI constants tensorize. In this paper, we extend the tensorization property to the quantum regime: we establish the tensorization of SDPIs for the quantum χκ1/22 divergence for arbitrary quantum channels and also for a family of χκ2 divergences (with κ≥κ1/2 ) for arbitrary quantum-classical channels.