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

Cambridge University Press eBooks

Monotone metrics and measures

Ingemar Bengtsson, Karol Życzkowski

Published May 11, 2006• 0 citations
Publisher

Abstract

Probability theory is a measure theory – with a soul. Mark Kac Section 2.6 was devoted to classical ensembles , that is to say ensembles defined by probability measures on the set of classical probability distributions over N events. In this chapter quantum ensembles are defined by choosing probability measures on the set of density matrices of size N . A warning should be issued first: there is no single, naturally distinguished measure in M ( N ) , so we have to analyse several measures, each of them with different physical motivations, advantages and drawbacks. This is in contrast to the set of pure quantum states, where the Fubini–Study measure is the only natural choice for a measure that defines ‘random states’. A simple way to define a probability measure goes through a metric. Hence we will start this chapter with a review of the metrics defined on the set of mixed quantum states. Monotone metrics In Section 2.5 we explained how the Fisher metric holds its distinguished position due to the theorem of Čencov, which states that the Fisher metric is the unique monotone metric on the probability simplex Δ N –1 . Now that the latter has been replaced by the space of quantum states M ( N ) we must look again at the question of metrics. Since the uniqueness in the classical case came from the behaviour under stochastic maps, we turn our attention to stochastic quantum maps – the completely positive, trace preserving maps discussed in Chapter 10. A distance D in the space of quantum states M ( N ) is called monotone if it does not grow under the action of a stochastic map Φ, If a monotone distance is geodesic the corresponding metric on M ( N ) is called monotone.

DOI
10.1017/cbo9780511535048.015

Related papers

Extending the Fisher metric to density matrices

D�nes Petz, Cs. Sudar

Chentsov studied Riemannian metrics on the set of probability measures from the point of view of decision theory. He proved that up to a constant factor the Fisher information is the only metric which is monotone under stochastic transformations. The present paper deals with monotone metrics on the space of finite density matrices on the basis motivated by quantum mechanics. A characterization of those metrics is given in terms of operator monotone functions. Several concrete metrics are constructed and analyzed, in particular, instead of the uniqueness in the probabilistic case, there is a large class of monotone metrics. Some of those appeared already in the physics literature a long time ago. A limiting procedure to pure states is discussed as well.

arXiv:quant-ph/0102132•Feb 27, 2001•20 citations

Geometries of quantum states

Dėnes Petz, Csaba Sudár

The quantum analog of the Fisher information metric of a probability simplex is searched and several Riemannian metrics on the set of positive definite density matrices are studied. Some of them appeared in the literature in connection with Cramér–Rao-type inequalities or the generalization of the Berry phase to mixed states. They are shown to be stochastically monotone here. All stochastically monotone Riemannian metrics are characterized by means of operator monotone functions and it is proven that there exist a maximal and a minimal among them. A class of metrics can be extended to pure states and a constant multiple of the Fubini–Study metric appears in the extension.

Journal of Mathematical Physics•Jun 1, 1996•234 citations

Distinguishability measures

Ingemar Bengtsson, Karol Zyczkowski

Niels Bohr supposedly said that if quantum mechanics did not make you dizzy then you did not understand it. I think that the same can be said about statistical inference. Robert D. Cousins In this chapter we quantify how easy it may be too distinguish probability distributions from each other (a discussion that was started in Chapter 2). The issue is a very practical one and arises whenever one is called upon to make a decision based on imperfect data. There is no unique answer because everything depends on the data – the l 1 -distance appears if there has been just one sampling of the distributions, the relative entropy governs the approach to the ‘true’ distribution as the number of samplings goes to infinity, and so on. The quantum case is even subtler. A quantum state always stands ready to produce a large variety of classical probability distributions, depending on the choice of measurement procedure. It is no longer possible to distinguish pure states from each other with certainty, unless they are orthogonal. The basic idea behind the quantum distinguishability measures is the same as that which allowed us, in Section 5.3, to relate the Fubini–Study metric to the Fisher–Rao metric. We will optimize over all possible measurements. Classical distinguishability measures If a distance function has an operational significance as a measure of statistical distinguishability, then we expect it to be monotone (and decreasing) under general stochastic maps. Coarse graining means that information is being discarded, and this cannot increase distinguishability.

Cambridge University Press eBooks•May 11, 2006•0 citations

Geometrical Statistics Classical and Quantum

Bengtsson, I

This is a review of the ideas behind the Fisher--Rao metric on classical probability distributions, and how they generalize to metrics on density matrices. As is well known, the unique Fisher--Rao metric then becomes a large family of monotone metrics. Finally I focus on the Bures--Uhlmann metric, and discuss a recent result that connects the geometric operator mean to a geodesic billiard on the set of density matrices.

•Sep 2, 2005•3 citations

Geometrical Statistics—Classical and Quantum

Ingemar Bengtsson

This is a review of the ideas behind the Fisher‐Rao metric on classical probability distributions, and how they generalize to metrics on density matrices. As is well known, the unique Fisher‐Rao metric then becomes a large family of monotone metrics. Finally I focus on the Bures‐Uhlmann metric, and discuss a recent result that connects the geometric operator mean to a geodesic billiard on the set of density matrices.

arXiv:quant-ph/0509017•AIP conference proceedings•Jan 1, 2006•0 citations

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
Probability theory is a measure theory – with a soul. Mark Kac Section 2.6 was devoted to classical ensembles , that is to say ensembles defined by probability measures on the set of classical probability distributions over N events. In this chapter quantum ensembles are defined by choosing probability measures on the set of density matrices of size N . A warning should be issued first: there is no single, naturally distinguished measure in M ( N ) , so we have to analyse several measures, each of them with different physical motivations, advantages and drawbacks. This is in contrast to the set of pure quantum states, where the Fubini–Study measure is the only natural choice for a measure that defines ‘random states’. A simple way to define a probability measure goes through a metric. Hence we will start this chapter with a review of the metrics defined on the set of mixed quantum states. Monotone metrics In Section 2.5 we explained how the Fisher metric holds its distinguished position due to the theorem of Čencov, which states that the Fisher metric is the unique monotone metric on the probability simplex Δ N –1 . Now that the latter has been replaced by the space of quantum states M ( N ) we must look again at the question of metrics. Since the uniqueness in the classical case came from the behaviour under stochastic maps, we turn our attention to stochastic quantum maps – the completely positive, trace preserving maps discussed in Chapter 10. A distance D in the space of quantum states M ( N ) is called monotone if it does not grow under the action of a stochastic map Φ, If a monotone distance is geodesic the corresponding metric on M ( N ) is called monotone.
Chentsov studied Riemannian metrics on the set of probability measures from the point of view of decision theory. He proved that up to a constant factor the Fisher information is the only metric which is monotone under stochastic transformations. The present paper deals with monotone metrics on the space of finite density matrices on the basis motivated by quantum mechanics. A characterization of those metrics is given in terms of operator monotone functions. Several concrete metrics are constructed and analyzed, in particular, instead of the uniqueness in the probabilistic case, there is a large class of monotone metrics. Some of those appeared already in the physics literature a long time ago. A limiting procedure to pure states is discussed as well.
The quantum analog of the Fisher information metric of a probability simplex is searched and several Riemannian metrics on the set of positive definite density matrices are studied. Some of them appeared in the literature in connection with Cramér–Rao-type inequalities or the generalization of the Berry phase to mixed states. They are shown to be stochastically monotone here. All stochastically monotone Riemannian metrics are characterized by means of operator monotone functions and it is proven that there exist a maximal and a minimal among them. A class of metrics can be extended to pure states and a constant multiple of the Fubini–Study metric appears in the extension.
Niels Bohr supposedly said that if quantum mechanics did not make you dizzy then you did not understand it. I think that the same can be said about statistical inference. Robert D. Cousins In this chapter we quantify how easy it may be too distinguish probability distributions from each other (a discussion that was started in Chapter 2). The issue is a very practical one and arises whenever one is called upon to make a decision based on imperfect data. There is no unique answer because everything depends on the data – the l 1 -distance appears if there has been just one sampling of the distributions, the relative entropy governs the approach to the ‘true’ distribution as the number of samplings goes to infinity, and so on. The quantum case is even subtler. A quantum state always stands ready to produce a large variety of classical probability distributions, depending on the choice of measurement procedure. It is no longer possible to distinguish pure states from each other with certainty, unless they are orthogonal. The basic idea behind the quantum distinguishability measures is the same as that which allowed us, in Section 5.3, to relate the Fubini–Study metric to the Fisher–Rao metric. We will optimize over all possible measurements. Classical distinguishability measures If a distance function has an operational significance as a measure of statistical distinguishability, then we expect it to be monotone (and decreasing) under general stochastic maps. Coarse graining means that information is being discarded, and this cannot increase distinguishability.
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.