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

Recoverability for optimized quantum f -divergences

Li Gao, Mark M. Wilde

Published Aug 16, 2021• 24 citations
arXivHTMLPDF

Abstract

Abstract The optimized quantum f -divergences form a family of distinguishability measures that includes the quantum relative entropy and the sandwiched Rényi relative quasi-entropy as special cases. In this paper, we establish physically meaningful refinements of the data-processing inequality for the optimized f -divergence. In particular, the refinements state that the absolute difference between the optimized f -divergence and its channel-processed version is an upper bound on how well one can recover a quantum state acted upon by a quantum channel, whenever the recovery channel is taken to be a rotated Petz recovery channel. Not only do these results lead to physically meaningful refinements of the data-processing inequality for the sandwiched Rényi relative entropy, but they also have implications for perfect reversibility (i.e. quantum sufficiency) of the optimized f -divergences. Along the way, we improve upon previous physically meaningful refinements of the data-processing inequality for the standard f -divergence, as established in recent work of Carlen and Vershynina [arXiv: 1710.02409 , arXiv: 1710.08080 ]. Finally, we extend the definition of the optimized f -divergence, its data-processing inequality, and all of our recoverability results to the general von Neumann algebraic setting, so that all of our results can be employed in physical settings beyond those confined to the most common finite-dimensional setting of interest in quantum information theory.

DOI
10.1088/1751-8121/ac1dc2

Related papers

Approximate recoverability and the quantum data processing inequality

Saptak Bhattacharya

In this paper, we discuss the quantum data processing inequality and its refinements that are physically meaningful in the context of approximate recoverability. An important conjecture regarding this due to Seshadreesan et al. in [Rényi squashed entanglement, discord and relative entropy differences, J. Phys. A: Math. Theor. 48(39) (2015) 395303] is disproved. We prove some inequalities capturing universal approximate recoverability with the Petz recovery map for the sandwiched quasi and Rényi relative entropies for the parameter [Formula: see text]. We also obtain convexity theorems on some parametrized versions of the relative entropy and fidelity, which can be of independent interest.

arXiv:2309.02074•Reviews in Mathematical Physics•Jul 28, 2026•3 citations

Universal recoverability of quantum states in tracial von-Neumann algebras

Saptak Bhattacharya

In this paper, we discuss a refinement of quantum data processing inequality for the sandwiched quasi-relative entropy $\mathcal{S}_2$ on a tracial von-Neumann algebra. The main result is a universal recoverability bound with the Petz recovery map, which was previously obtained in the finite dimensional setup.

quant-pharXiv:2512.08418•Dec 10, 2025•2 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

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

Monotonicity of f-divergences: A review with new results

Fumio Hiai, Milán Mosonyi, Dėnes Petz

Quantum f-divergences are a quantum generalization of the classical notion of f-divergences, and are a special case of Petz' quasi-entropies. Many well known distinguishability measures of quantum states are given by, or derived from, f-divergences; special examples include the quantum relative entropy, the Renyi relative entropies, and the Chernoff and Hoeffding measures. Here we show that the quantum f-divergences are monotonic under the dual of Schwarz maps whenever the defining function is operator convex. This extends and unifies all previously known monotonicity results. We also analyze the case where the monotonicity inequality holds with equality, and extend Petz' reversibility theorem for a large class of f-divergences and other distinguishability measures. We apply our findings to the problem of quantum error correction, and show that if a stochastic map preserves the pairwise distinguishability on a set of states, as measured by a suitable f-divergence, then its action can be reversed on that set by another stochastic map that can be constructed from the original one in a canonical way. We also provide an integral representation for operator convex functions on the positive half-line, which is the main ingredient in extending previously known results on the monotonicity inequality and the case of equality. We also consider some special cases where the convexity of f is sufficient for the monotonicity, and obtain the inverse Holder inequality for operators as an application. The presentation is completely self-contained and requires only standard knowledge of matrix analysis.

•Aug 17, 2010•3 citations

QUANTUM f-DIVERGENCES AND ERROR CORRECTION

Fumio Hiai, Milán Mosonyi, Dėnes Petz +1 more

Quantum f-divergences are a quantum generalization of the classical notion of f-divergences, and are a special case of Petz' quasi-entropies. Many well-known distinguishability measures of quantum states are given by, or derived from, f-divergences. Special examples include the quantum relative entropy, the Rényi relative entropies, and the Chernoff and Hoeffding measures. Here we show that the quantum f-divergences are monotonic under substochastic maps whenever the defining function is operator convex. This extends and unifies all previously known monotonicity results for this class of distinguishability measures. We also analyze the case where the monotonicity inequality holds with equality, and extend Petz' reversibility theorem for a large class of f-divergences and other distinguishability measures. We apply our findings to the problem of quantum error correction, and show that if a stochastic map preserves the pairwise distinguishability on a set of states, as measured by a suitable f-divergence, then its action can be reversed on that set by another stochastic map that can be constructed from the original one in a canonical way. We also provide an integral representation for operator convex functions on the positive half-line, which is the main ingredient in extending previously known results on the monotonicity inequality and the case of equality. We also consider some special cases where the convexity of f is sufficient for the monotonicity, and obtain the inverse Hölder inequality for operators as an application. The presentation is completely self-contained and requires only standard knowledge of matrix analysis.

arXiv:1008.2529•Reviews in Mathematical Physics•Aug 1, 2011•174 citations
Abstract The optimized quantum f -divergences form a family of distinguishability measures that includes the quantum relative entropy and the sandwiched Rényi relative quasi-entropy as special cases. In this paper, we establish physically meaningful refinements of the data-processing inequality for the optimized f -divergence. In particular, the refinements state that the absolute difference between the optimized f -divergence and its channel-processed version is an upper bound on how well one can recover a quantum state acted upon by a quantum channel, whenever the recovery channel is taken to be a rotated Petz recovery channel. Not only do these results lead to physically meaningful refinements of the data-processing inequality for the sandwiched Rényi relative entropy, but they also have implications for perfect reversibility (i.e. quantum sufficiency) of the optimized f -divergences. Along the way, we improve upon previous physically meaningful refinements of the data-processing inequality for the standard f -divergence, as established in recent work of Carlen and Vershynina [arXiv: 1710.02409 , arXiv: 1710.08080 ]. Finally, we extend the definition of the optimized f -divergence, its data-processing inequality, and all of our recoverability results to the general von Neumann algebraic setting, so that all of our results can be employed in physical settings beyond those confined to the most common finite-dimensional setting of interest in quantum information theory.
In this paper, we discuss the quantum data processing inequality and its refinements that are physically meaningful in the context of approximate recoverability. An important conjecture regarding this due to Seshadreesan et al. in [Rényi squashed entanglement, discord and relative entropy differences, J. Phys. A: Math. Theor. 48(39) (2015) 395303] is disproved. We prove some inequalities capturing universal approximate recoverability with the Petz recovery map for the sandwiched quasi and Rényi relative entropies for the parameter [Formula: see text]. We also obtain convexity theorems on some parametrized versions of the relative entropy and fidelity, which can be of independent interest.
In this paper, we discuss a refinement of quantum data processing inequality for the sandwiched quasi-relative entropy S2\mathcal{S}_2S2​ on a tracial von-Neumann algebra. The main result is a universal recoverability bound with the Petz recovery map, which was previously obtained in the finite dimensional setup.
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
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.
Quantum f-divergences are a quantum generalization of the classical notion of f-divergences, and are a special case of Petz' quasi-entropies. Many well known distinguishability measures of quantum states are given by, or derived from, f-divergences; special examples include the quantum relative entropy, the Renyi relative entropies, and the Chernoff and Hoeffding measures. Here we show that the quantum f-divergences are monotonic under the dual of Schwarz maps whenever the defining function is operator convex. This extends and unifies all previously known monotonicity results. We also analyze the case where the monotonicity inequality holds with equality, and extend Petz' reversibility theorem for a large class of f-divergences and other distinguishability measures. We apply our findings to the problem of quantum error correction, and show that if a stochastic map preserves the pairwise distinguishability on a set of states, as measured by a suitable f-divergence, then its action can be reversed on that set by another stochastic map that can be constructed from the original one in a canonical way. We also provide an integral representation for operator convex functions on the positive half-line, which is the main ingredient in extending previously known results on the monotonicity inequality and the case of equality. We also consider some special cases where the convexity of f is sufficient for the monotonicity, and obtain the inverse Holder inequality for operators as an application. The presentation is completely self-contained and requires only standard knowledge of matrix analysis.
Quantum f-divergences are a quantum generalization of the classical notion of f-divergences, and are a special case of Petz' quasi-entropies. Many well-known distinguishability measures of quantum states are given by, or derived from, f-divergences. Special examples include the quantum relative entropy, the Rényi relative entropies, and the Chernoff and Hoeffding measures. Here we show that the quantum f-divergences are monotonic under substochastic maps whenever the defining function is operator convex. This extends and unifies all previously known monotonicity results for this class of distinguishability measures. We also analyze the case where the monotonicity inequality holds with equality, and extend Petz' reversibility theorem for a large class of f-divergences and other distinguishability measures. We apply our findings to the problem of quantum error correction, and show that if a stochastic map preserves the pairwise distinguishability on a set of states, as measured by a suitable f-divergence, then its action can be reversed on that set by another stochastic map that can be constructed from the original one in a canonical way. We also provide an integral representation for operator convex functions on the positive half-line, which is the main ingredient in extending previously known results on the monotonicity inequality and the case of equality. We also consider some special cases where the convexity of f is sufficient for the monotonicity, and obtain the inverse Hölder inequality for operators as an application. The presentation is completely self-contained and requires only standard knowledge of matrix analysis.