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:2510.02218

Quantum Fisher information matrices from Rényi relative entropies

Mark M. Wilde

Published Oct 2, 2025• 0 citations
arXivHTMLPDF

Abstract

Quantum generalizations of the Fisher information are important in quantum information science, with applications in high energy and condensed matter physics and in quantum estimation theory, machine learning, and optimization. One can derive a quantum generalization of the Fisher information matrix in a natural way as the Hessian matrix arising in a Taylor expansion of a smooth divergence. Such an approach is appealing for quantum information theorists, given the ubiquity of divergences in quantum information theory. In contrast to the classical case, there is not a unique quantum generalization of the Fisher information matrix, similar to how there is not a unique quantum generalization of the relative entropy or the Rényi relative entropy. In this paper, I derive information matrices arising from the log-Euclidean, $α$-$z$, and geometric Rényi relative entropies, with the main technical tool for doing so being the method of divided differences for calculating matrix derivatives. Interestingly, for all non-negative values of the Rényi parameter $α$, the log-Euclidean Rényi relative entropy leads to the Kubo-Mori information matrix, and the geometric Rényi relative entropy leads to the right-logarithmic derivative Fisher information matrix. Thus, the resulting information matrices obey the data-processing inequality for all non-negative values of the Rényi parameter $α$ even though the original quantities do not. Additionally, I derive and establish basic properties of $α$-$z$ information matrices resulting from the $α$-$z$ Rényi relative entropies. For parameterized thermal states and time-evolved states, I establish formulas for their $α$-$z$ information matrices and hybrid quantum-classical algorithms for estimating them, with applications in quantum Boltzmann machine learning.

DOI
10.48550/arxiv.2510.02218

Related papers

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•47 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

Geometric distinguishability measures limit quantum channel estimation and discrimination

Vishal Katariya, Mark M. Wilde

Quantum channel estimation and discrimination are fundamentally related information processing tasks of interest in quantum information science. In this paper, we analyze these tasks by employing the right logarithmic derivative Fisher information and the geometric Rényi relative entropy, respectively, and we also identify connections between these distinguishability measures. A key result of our paper is that a chain-rule property holds for the right logarithmic derivative Fisher information and the geometric Rényi relative entropy for the interval α∈ (0 , 1) of the Rényi parameter α. In channel estimation, these results imply a condition for the unattainability of Heisenberg scaling, while in channel discrimination, they lead to improved bounds on error rates in the Chernoff and Hoeffding error exponent settings. More generally, we introduce the amortized quantum Fisher information as a conceptual framework for analyzing general sequential protocols that estimate a parameter encoded in a quantum channel. We then use this framework, beyond the aforementioned application, to show that Heisenberg scaling is not possible when a parameter is encoded in a classical–quantum channel. We then identify a number of other conceptual and technical connections between the tasks of estimation and discrimination and the distinguishability measures involved in analyzing each. As part of this work, we present a detailed overview of the geometric Rényi relative entropy of quantum states and channels, as well as its properties, which may be of independent interest.

Civil War Book Review•Feb 1, 2021•42 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

Civil War Book Review•Aug 15, 2018•1 citation

Log-Euclidean Rényi Conditional Mutual Information

Roberto Rubboli, Amir Arqand, Mark M. Wilde

Quantum conditional mutual information (QCMI) is a fundamental measure of conditional independence, with central applications throughout quantum information theory and many-body physics. Despite its importance, finding a fully quantum Rényi generalization that satisfies all desirable structural properties has remained an open question. In this work, we introduce a quantum Rényi conditional mutual information possessing these desirable properties: it is monotone under local quantum channels, additive under tensor products, monotone in the Rényi parameter, and converges to the QCMI in the limit $α\to 1$. We establish bounds on this quantity in terms of relative entropies to the Petz-recovered state, showing that it provides a distinct measure of approximate conditional independence. As a consequence, we derive recovery-based upper and lower bounds on the QCMI in terms of quantum generalizations of the Kullback-Leibler divergence, improving upon the best known results in certain regimes. Finally, we establish bounds in terms of relative entropies to the sets of Markov and separable states and derive Rényi chain rules, which appear to be novel even in the classical setting.

quant-pharXiv:2609.34699•Sep 29, 2026•0 citations

The quantum ♮ α -Rényi divergence of real order

Yuki Seo

There are many proposals for defining a quantum version of the Rényi divergence on the differentiable manifold P of positive definite matrices. The geodesic connecting two points on P is a weighted matrix geometric mean, and its tangent vector is the relative operator entropy. It is a natural idea to use the relative operator entropy to describe the difference between two points on P. The quantum version of the classical results of Rényi divergence does not always hold due to its non-commutativity. Due to this difficulty, we use the upper bound and the lower one of the spectrum of positive definite matrices to estimate the order relation between quantum divergences, which is called the Mond Pečarić method in operator theory. In this paper, we show fundamental properties of the ♮α-Rényi divergence of real order α∈R, including monotonicity of order, the relation of max- and min-divergence, data processing inequality, bound estimates, and convexity. We also estimate the difference without the α–z-Rényi divergence and ♮α-Rényi divergence in terms of the generalized Kantorovich constant and the Specht ratio.

Journal of Mathematical Physics•Jul 1, 2022•2 citations
Quantum generalizations of the Fisher information are important in quantum information science, with applications in high energy and condensed matter physics and in quantum estimation theory, machine learning, and optimization. One can derive a quantum generalization of the Fisher information matrix in a natural way as the Hessian matrix arising in a Taylor expansion of a smooth divergence. Such an approach is appealing for quantum information theorists, given the ubiquity of divergences in quantum information theory. In contrast to the classical case, there is not a unique quantum generalization of the Fisher information matrix, similar to how there is not a unique quantum generalization of the relative entropy or the Rényi relative entropy. In this paper, I derive information matrices arising from the log-Euclidean, ααα-zzz, and geometric Rényi relative entropies, with the main technical tool for doing so being the method of divided differences for calculating matrix derivatives. Interestingly, for all non-negative values of the Rényi parameter ααα, the log-Euclidean Rényi relative entropy leads to the Kubo-Mori information matrix, and the geometric Rényi relative entropy leads to the right-logarithmic derivative Fisher information matrix. Thus, the resulting information matrices obey the data-processing inequality for all non-negative values of the Rényi parameter ααα even though the original quantities do not. Additionally, I derive and establish basic properties of ααα-zzz information matrices resulting from the ααα-zzz Rényi relative entropies. For parameterized thermal states and time-evolved states, I establish formulas for their ααα-zzz information matrices and hybrid quantum-classical algorithms for estimating them, with applications in quantum Boltzmann machine learning.
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 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
Quantum channel estimation and discrimination are fundamentally related information processing tasks of interest in quantum information science. In this paper, we analyze these tasks by employing the right logarithmic derivative Fisher information and the geometric Rényi relative entropy, respectively, and we also identify connections between these distinguishability measures. A key result of our paper is that a chain-rule property holds for the right logarithmic derivative Fisher information and the geometric Rényi relative entropy for the interval α∈ (0 , 1) of the Rényi parameter α. In channel estimation, these results imply a condition for the unattainability of Heisenberg scaling, while in channel discrimination, they lead to improved bounds on error rates in the Chernoff and Hoeffding error exponent settings. More generally, we introduce the amortized quantum Fisher information as a conceptual framework for analyzing general sequential protocols that estimate a parameter encoded in a quantum channel. We then use this framework, beyond the aforementioned application, to show that Heisenberg scaling is not possible when a parameter is encoded in a classical–quantum channel. We then identify a number of other conceptual and technical connections between the tasks of estimation and discrimination and the distinguishability measures involved in analyzing each. As part of this work, we present a detailed overview of the geometric Rényi relative entropy of quantum states and channels, as well as its properties, which may be of independent interest.
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
Quantum conditional mutual information (QCMI) is a fundamental measure of conditional independence, with central applications throughout quantum information theory and many-body physics. Despite its importance, finding a fully quantum Rényi generalization that satisfies all desirable structural properties has remained an open question. In this work, we introduce a quantum Rényi conditional mutual information possessing these desirable properties: it is monotone under local quantum channels, additive under tensor products, monotone in the Rényi parameter, and converges to the QCMI in the limit α→1α\to 1α→1. We establish bounds on this quantity in terms of relative entropies to the Petz-recovered state, showing that it provides a distinct measure of approximate conditional independence. As a consequence, we derive recovery-based upper and lower bounds on the QCMI in terms of quantum generalizations of the Kullback-Leibler divergence, improving upon the best known results in certain regimes. Finally, we establish bounds in terms of relative entropies to the sets of Markov and separable states and derive Rényi chain rules, which appear to be novel even in the classical setting.
There are many proposals for defining a quantum version of the Rényi divergence on the differentiable manifold P of positive definite matrices. The geodesic connecting two points on P is a weighted matrix geometric mean, and its tangent vector is the relative operator entropy. It is a natural idea to use the relative operator entropy to describe the difference between two points on P. The quantum version of the classical results of Rényi divergence does not always hold due to its non-commutativity. Due to this difficulty, we use the upper bound and the lower one of the spectrum of positive definite matrices to estimate the order relation between quantum divergences, which is called the Mond Pečarić method in operator theory. In this paper, we show fundamental properties of the ♮α-Rényi divergence of real order α∈R, including monotonicity of order, the relation of max- and min-divergence, data processing inequality, bound estimates, and convexity. We also estimate the difference without the α–z-Rényi divergence and ♮α-Rényi divergence in terms of the generalized Kantorovich constant and the Specht ratio.