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

A new information metric and a possible higher bound for a class of measurements in the Quantum Estimation Problem

Demetris P. K. Ghikas, Fotios D. Oikonomou

Published Oct 6, 2012• 1 citation
arXivHTMLPDF

Abstract

Information metrics give lower bounds for the estimation of parameters. The Cencov-Morozova-Petz Theorem classifies the monotone quantum Fisher metrics. The optimum bound for the quantum estimation problem is offered by the metric which is obtained from the symmetric logarithmic derivative. To get a better bound, it means to go outside this family of metrics, and thus inevitably, to relax some general conditions. In the paper we defined logarithmic derivatives through a phase-space correspondence. This introduces a function which quantifies the deviation from the symmetric derivative. Using this function we have proved that there exist POVMs for which the new metric gives a higher bound from that of the symmetric derivative. The analysis was performed for the one qubit case.

DOI
10.48550/arxiv.1210.1977

Related papers

Analysis of SM quantum information

Caleb J O'Loan

Morozova and Chentsov (Morozova and Chentsov 90) studied Riemannian metrics on the set of probability measures. They showed that, up to a constant factor, the Fisher information is the only Riemannian metric which is monotone under stochastic transformation. Sarovar and Milburn (Sarovar and Milburn 06) computed an upper bound on the Fisher information for one-parameter channels. In (O'Loan 07) we extended their bound to an upper bound on the Fisher information of multi-parameter families of states; we call this the SM quantum information. Petz and Sudár (Petz 95) characterized fully the set of monotone metrics on the space of all density matrices. We analyse the SM quantum information in light of their work. We show that the SM quantum information is not a well-defined metric on the space of density matrices: different choices of phase of the eigenvectors lead to different metrics. We define a new metric C_L as a lower bound among the SM quantum informations. We look at properties of C_L and show that it is invariant but not monotone.

arXiv:0805.0099•May 1, 2008•0 citations

Characterizations of symmetric monotone metrics on the state space of quantum systems

Frank Hansen

The quantum Fisher information is a Riemannian metric, defined on the state space of a quantum system, which is symmetric and decreasing under stochastic mappings. Contrary to the classical case such a metric is not unique. We complete the characterization, initiated by Morozova, Chentsov and Petz, of these metrics by providing a closed and tractable formula for the set of Morozova-Chentsov functions. In addition, we provide a continuously increasing bridge between the smallest and largest symmetric monotone metrics.

arXiv:math-ph/0601056•Quantum Information and Computation•Nov 1, 2006•21 citations

Bayesian Monotone Metrics for Multiparameter Quantum Estimation

Jianchao Zhang, Koichi Yamagata, Jun Suzuki

Bayesian quantum estimation offers a finite-data framework for quantum sensing and metrology, yet a unified geometric formulation for multiparameter Bayes risk has been lacking. We introduce Bayesian monotone metrics by evaluating Petz monotone metrics on the prior-averaged state, providing a Bayesian extension of the full class of statistically meaningful (CPTP) quantum metrics. This framework yields Bayesian quantities, including quantum posterior-mean operators and a quantum Bayesian dual Fisher-information matrix, and it leads to a systematic family of computable lower bounds on the Bayes risk. The resulting bounds naturally incorporate multiparameter measurement incompatibility and, for every monotone metric in the family, we prove a universal dominance over the corresponding quantum van Trees (Bayesian Cramér--Rao) bound. Moreover, we show that optimizing over all operator monotone functions collapses to a one-parameter subfamily, turning the tightest bound into a tractable optimization with a clear geometric interpretation. In representative examples, the optimized bounds are strictly tighter than the Bayesian SLD and RLD bounds. Our results establish Bayesian monotone metrics as a unifying information-geometric perspective on Bayesian quantum estimation, enabling systematic and computable performance limits in multiparameter settings.

quant-pharXiv:2607.01685•Jul 3, 2026•3 citations

Characterization of symmetric monotone metrics on matrix spaces

Frank Hansen

The quantum Fisher information is a Riemannian metric, defined on the state space of a quantum system, which is symmetric and decreasing under stochastic mappings. Contrary to the classical case such a metric is not unique. We complete the characterization, initiated by Morozova, Chentsov and Petz, of these metrics by providing a closed and tractable formula for the set of Morozova-Chentsov functions. In addition, we provide a continuously increasing bridge between the smallest and largest symmetric monotone metrics.

•Jan 26, 2006•0 citations

Maximum logarithmic derivative bound on quantum state estimation as a dual of the Holevo bound

K. Yamagata

In quantum estimation theory, the Holevo bound is known as a lower bound of weighted traces of covariances of unbiased estimators. The Holevo bound is defined by a solution of a minimization problem, and in general, an explicit solution is not known. When the dimension of Hilbert space is 2 and the number of parameters is 2, an explicit form of the Holevo bound was given by Suzuki. In this paper, we focus on a logarithmic derivative that lies between the symmetric logarithmic derivative (SLD) and the right logarithmic derivative parameterized by β ∈ [0, 1] to obtain lower bounds of the weighted trace of covariance of an unbiased estimator. We introduce the maximum logarithmic derivative bound as the maximum of bounds with respect to β. We show that all monotone metrics induce lower bounds, and the maximum logarithmic derivative bound is the largest bound among them. We show that the maximum logarithmic derivative bound has explicit solution when the d dimensional model has d + 1 dimensional D invariant extension of the SLD tangent space. Furthermore, when d = 2, we show that the maximization problem to define the maximum logarithmic derivative bound is the Lagrangian duality of the minimization problem to define the Holevo bound and is the same as the Holevo bound. This explicit solution is a generalization of the solution for a two-dimensional Hilbert space given by Suzuki. We also give examples of families of quantum states to which our theory can be applied not only for two-dimensional Hilbert spaces.

arXiv:2106.06294•Journal of Mathematical Physics•Jun 1, 2021•8 citations

Analysis of a convenient information bound for general quantum channels

C J O'Loan

Open questions from Sarovar and Milburn (2006 J.Phys. A: Math. Gen. 39 8487) are answered. Sarovar and Milburn derived a convenient upper bound for the Fisher information of a one-parameter quantum channel. They showed that for quasi-classical models their bound is achievable and they gave a necessary and sufficient condition for positive operator-valued measures (POVMs) attaining this bound. They asked (i) whether their bound is attainable more generally, (ii) whether explicit expressions for optimal POVMs can be derived from the attainability condition. We show that the symmetric logarithmic derivative (SLD) quantum information is less than or equal to the SM bound, i.e.\ $H(θ) \leq C_Υ(θ)$ and we find conditions for equality. As the Fisher information is less than or equal to the SLD quantum information, i.e. $F_M(θ) \leq H(θ)$, we can deduce when equality holds in $F_M(θ) \leq C_Υ(θ)$. Equality does not hold for all channels. As a consequence, the attainability condition cannot be used to test for optimal POVMs for all channels. These results are extended to multi-parameter channels.

arXiv:0705.0931•Journal of Physics A Mathematical and Theoretical•Nov 14, 2007•3 citations
Information metrics give lower bounds for the estimation of parameters. The Cencov-Morozova-Petz Theorem classifies the monotone quantum Fisher metrics. The optimum bound for the quantum estimation problem is offered by the metric which is obtained from the symmetric logarithmic derivative. To get a better bound, it means to go outside this family of metrics, and thus inevitably, to relax some general conditions. In the paper we defined logarithmic derivatives through a phase-space correspondence. This introduces a function which quantifies the deviation from the symmetric derivative. Using this function we have proved that there exist POVMs for which the new metric gives a higher bound from that of the symmetric derivative. The analysis was performed for the one qubit case.
Morozova and Chentsov (Morozova and Chentsov 90) studied Riemannian metrics on the set of probability measures. They showed that, up to a constant factor, the Fisher information is the only Riemannian metric which is monotone under stochastic transformation. Sarovar and Milburn (Sarovar and Milburn 06) computed an upper bound on the Fisher information for one-parameter channels. In (O'Loan 07) we extended their bound to an upper bound on the Fisher information of multi-parameter families of states; we call this the SM quantum information. Petz and Sudár (Petz 95) characterized fully the set of monotone metrics on the space of all density matrices. We analyse the SM quantum information in light of their work. We show that the SM quantum information is not a well-defined metric on the space of density matrices: different choices of phase of the eigenvectors lead to different metrics. We define a new metric C_L as a lower bound among the SM quantum informations. We look at properties of C_L and show that it is invariant but not monotone.
The quantum Fisher information is a Riemannian metric, defined on the state space of a quantum system, which is symmetric and decreasing under stochastic mappings. Contrary to the classical case such a metric is not unique. We complete the characterization, initiated by Morozova, Chentsov and Petz, of these metrics by providing a closed and tractable formula for the set of Morozova-Chentsov functions. In addition, we provide a continuously increasing bridge between the smallest and largest symmetric monotone metrics.
Bayesian quantum estimation offers a finite-data framework for quantum sensing and metrology, yet a unified geometric formulation for multiparameter Bayes risk has been lacking. We introduce Bayesian monotone metrics by evaluating Petz monotone metrics on the prior-averaged state, providing a Bayesian extension of the full class of statistically meaningful (CPTP) quantum metrics. This framework yields Bayesian quantities, including quantum posterior-mean operators and a quantum Bayesian dual Fisher-information matrix, and it leads to a systematic family of computable lower bounds on the Bayes risk. The resulting bounds naturally incorporate multiparameter measurement incompatibility and, for every monotone metric in the family, we prove a universal dominance over the corresponding quantum van Trees (Bayesian Cramér--Rao) bound. Moreover, we show that optimizing over all operator monotone functions collapses to a one-parameter subfamily, turning the tightest bound into a tractable optimization with a clear geometric interpretation. In representative examples, the optimized bounds are strictly tighter than the Bayesian SLD and RLD bounds. Our results establish Bayesian monotone metrics as a unifying information-geometric perspective on Bayesian quantum estimation, enabling systematic and computable performance limits in multiparameter settings.
The quantum Fisher information is a Riemannian metric, defined on the state space of a quantum system, which is symmetric and decreasing under stochastic mappings. Contrary to the classical case such a metric is not unique. We complete the characterization, initiated by Morozova, Chentsov and Petz, of these metrics by providing a closed and tractable formula for the set of Morozova-Chentsov functions. In addition, we provide a continuously increasing bridge between the smallest and largest symmetric monotone metrics.
In quantum estimation theory, the Holevo bound is known as a lower bound of weighted traces of covariances of unbiased estimators. The Holevo bound is defined by a solution of a minimization problem, and in general, an explicit solution is not known. When the dimension of Hilbert space is 2 and the number of parameters is 2, an explicit form of the Holevo bound was given by Suzuki. In this paper, we focus on a logarithmic derivative that lies between the symmetric logarithmic derivative (SLD) and the right logarithmic derivative parameterized by β ∈ [0, 1] to obtain lower bounds of the weighted trace of covariance of an unbiased estimator. We introduce the maximum logarithmic derivative bound as the maximum of bounds with respect to β. We show that all monotone metrics induce lower bounds, and the maximum logarithmic derivative bound is the largest bound among them. We show that the maximum logarithmic derivative bound has explicit solution when the d dimensional model has d + 1 dimensional D invariant extension of the SLD tangent space. Furthermore, when d = 2, we show that the maximization problem to define the maximum logarithmic derivative bound is the Lagrangian duality of the minimization problem to define the Holevo bound and is the same as the Holevo bound. This explicit solution is a generalization of the solution for a two-dimensional Hilbert space given by Suzuki. We also give examples of families of quantum states to which our theory can be applied not only for two-dimensional Hilbert spaces.
Open questions from Sarovar and Milburn (2006 J.Phys. A: Math. Gen. 39 8487) are answered. Sarovar and Milburn derived a convenient upper bound for the Fisher information of a one-parameter quantum channel. They showed that for quasi-classical models their bound is achievable and they gave a necessary and sufficient condition for positive operator-valued measures (POVMs) attaining this bound. They asked (i) whether their bound is attainable more generally, (ii) whether explicit expressions for optimal POVMs can be derived from the attainability condition. We show that the symmetric logarithmic derivative (SLD) quantum information is less than or equal to the SM bound, i.e.\ H(θ)≤CΥ(θ)H(θ) \leq C_Υ(θ)H(θ)≤CΥ​(θ) and we find conditions for equality. As the Fisher information is less than or equal to the SLD quantum information, i.e. FM(θ)≤H(θ)F_M(θ) \leq H(θ)FM​(θ)≤H(θ), we can deduce when equality holds in FM(θ)≤CΥ(θ)F_M(θ) \leq C_Υ(θ)FM​(θ)≤CΥ​(θ). Equality does not hold for all channels. As a consequence, the attainability condition cannot be used to test for optimal POVMs for all channels. These results are extended to multi-parameter channels.