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:quant-ph/0511170

Reverse estimation theory, Complementality between RLD and SLD, and monotone distances

Keiji Matsumoto

Published Nov 17, 2005• 12 citations
arXivHTMLPDF

Abstract

Many problems in quantum information theory can be vied as interconversion between resources. In this talk, we apply this view point to state estimation theory, motivated by the following observations. First, a monotone metric takes value between SLD and RLD Fisher metric. This is quite analogous to the fact that entanglement measures are sandwiched by distillable entanglement and entanglement cost. Second, SLD add RLD are mutually complement via purification of density matrices, but its operational meaning was not clear. To find a link between these observations, we define reverse estimation problem, or simulation of quantum state family by probability distribution family, proving that RLD Fisher metric is a solution to local reverse estimation problem of quantum state family with 1-dim parameter. This result gives new proofs of some known facts and proves one new fact about monotone distances. We also investigate information geometry of RLD, and reverse estimation theory of a multi-dimensional parameter family.

DOI
10.48550/arxiv.quant-ph/0511170

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

Information geometry of density matrices and state estimation

Dorje C. Brody

Given a pure state vector | x ⟩ and a density matrix , the function defines a probability density on the space of pure states parameterised by density matrices. The associated Fisher–Rao information measure is used to define a unitary invariant Riemannian metric on the space of density matrices. An alternative derivation of the metric, based on square-root density matrices and trace norms, is provided. This is applied to the problem of quantum-state estimation. In the simplest case of unitary parameter estimation, new higher-order corrections to the uncertainty relations, applicable to general mixed states, are derived.

arXiv:1009.1115•Journal of Physics A Mathematical and Theoretical•May 19, 2011•32 citations

Quantum estimation for quantum technology

Matteo G. A. Paris

Several quantities of interest in quantum information, including entanglement and purity, are nonlinear functions of the density matrix and cannot, even in principle, correspond to proper quantum observables. Any method aimed to determine the value of these quantities should resort to indirect measurements and thus corresponds to a parameter estimation problem whose solution, i.e the determination of the most precise estimator, unavoidably involves an optimization procedure. We review local quantum estimation theory and present explicit formulas for the symmetric logarithmic derivative and the quantum Fisher information of relevant families of quantum states. Estimability of a parameter is defined in terms of the quantum signal-to-noise ratio and the number of measurements needed to achieve a given relative error. The connections between the optmization procedure and the geometry of quantum statistical models are discussed. Our analysis allows to quantify quantum noise in the measurements of non observable quantities and provides a tools for the characterization of signals and devices in quantum technology. 1.

•Apr 18, 2008•0 citations

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

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.

arXiv:1210.1977•Oct 6, 2012•1 citation

Distillation and simulation in quantum information

Kun Fang

We use the techniques of convex optimization, especially semidefinite programming, to study two kinds of fundamental tasks, i.e., distillation and simulation in quantum information theory. We investigate these tasks in a unified framework of resource theory and focus on their computation and characterization with finite resources. Particularly we study the tradeoff among relevant parameters such as the number of resource copies, resource transformation rate, error tolerance and success probability. In the first part, we study the task of distillation for two different resources, maximally entangled state and maximally coherent state, representing nonlocal and local “quantumness” respectively. For entanglement distillation, we derive an efficiently computable second-order estimation of the distillation rate for general quantum states, which are tight for quantum states of practical interest. Our study overcomes the limitation of conventional research either focusing on the asymptotic rate or ignoring the computability. For the coherence distillation, we perform finite analysis for both deterministic and probabilistic scenarios. Our results unveil several new features of coherence from a resource theoretic viewpoint and contribute to an increased understanding of the fundamental properties of different sets of free operations. In the second part, we investigate the resource cost of simulating a quantum channel via quantum coherence or another quantum channel. We introduce the channel’s analogs of max-relative entropy, logarithmic robustness and max-information of quantum states, providing their operational interpretation with the channel simulation cost via different resources. Particularly, we establish the asymptotic equipartition property of the channel’s max-information, that is, it converges to the quantum mutual information of the channel in the independent and identically distributed asymptotic limit. As applications, this asymptotic equipartition property implies the quantum reverse Shannon theorem in the presence of non-signalling correlations. From the perspective of resource theory, the worth of a resource can usually be characterized by the minimum distance to a set of useless resources under a proper distance measure. We give such characterization for all the tasks studied in this thesis, and find that the distance measure for the distillation and simulation process naturally corresponds to the quantum hypothesis testing relative entropy and the max-relative entropy, respectively.

•Jan 1, 2018•1 citation

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
Many problems in quantum information theory can be vied as interconversion between resources. In this talk, we apply this view point to state estimation theory, motivated by the following observations. First, a monotone metric takes value between SLD and RLD Fisher metric. This is quite analogous to the fact that entanglement measures are sandwiched by distillable entanglement and entanglement cost. Second, SLD add RLD are mutually complement via purification of density matrices, but its operational meaning was not clear. To find a link between these observations, we define reverse estimation problem, or simulation of quantum state family by probability distribution family, proving that RLD Fisher metric is a solution to local reverse estimation problem of quantum state family with 1-dim parameter. This result gives new proofs of some known facts and proves one new fact about monotone distances. We also investigate information geometry of RLD, and reverse estimation theory of a multi-dimensional parameter family.
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.
Given a pure state vector | x ⟩ and a density matrix , the function defines a probability density on the space of pure states parameterised by density matrices. The associated Fisher–Rao information measure is used to define a unitary invariant Riemannian metric on the space of density matrices. An alternative derivation of the metric, based on square-root density matrices and trace norms, is provided. This is applied to the problem of quantum-state estimation. In the simplest case of unitary parameter estimation, new higher-order corrections to the uncertainty relations, applicable to general mixed states, are derived.
Several quantities of interest in quantum information, including entanglement and purity, are nonlinear functions of the density matrix and cannot, even in principle, correspond to proper quantum observables. Any method aimed to determine the value of these quantities should resort to indirect measurements and thus corresponds to a parameter estimation problem whose solution, i.e the determination of the most precise estimator, unavoidably involves an optimization procedure. We review local quantum estimation theory and present explicit formulas for the symmetric logarithmic derivative and the quantum Fisher information of relevant families of quantum states. Estimability of a parameter is defined in terms of the quantum signal-to-noise ratio and the number of measurements needed to achieve a given relative error. The connections between the optmization procedure and the geometry of quantum statistical models are discussed. Our analysis allows to quantify quantum noise in the measurements of non observable quantities and provides a tools for the characterization of signals and devices in quantum technology. 1.
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.
We use the techniques of convex optimization, especially semidefinite programming, to study two kinds of fundamental tasks, i.e., distillation and simulation in quantum information theory. We investigate these tasks in a unified framework of resource theory and focus on their computation and characterization with finite resources. Particularly we study the tradeoff among relevant parameters such as the number of resource copies, resource transformation rate, error tolerance and success probability. In the first part, we study the task of distillation for two different resources, maximally entangled state and maximally coherent state, representing nonlocal and local “quantumness” respectively. For entanglement distillation, we derive an efficiently computable second-order estimation of the distillation rate for general quantum states, which are tight for quantum states of practical interest. Our study overcomes the limitation of conventional research either focusing on the asymptotic rate or ignoring the computability. For the coherence distillation, we perform finite analysis for both deterministic and probabilistic scenarios. Our results unveil several new features of coherence from a resource theoretic viewpoint and contribute to an increased understanding of the fundamental properties of different sets of free operations. In the second part, we investigate the resource cost of simulating a quantum channel via quantum coherence or another quantum channel. We introduce the channel’s analogs of max-relative entropy, logarithmic robustness and max-information of quantum states, providing their operational interpretation with the channel simulation cost via different resources. Particularly, we establish the asymptotic equipartition property of the channel’s max-information, that is, it converges to the quantum mutual information of the channel in the independent and identically distributed asymptotic limit. As applications, this asymptotic equipartition property implies the quantum reverse Shannon theorem in the presence of non-signalling correlations. From the perspective of resource theory, the worth of a resource can usually be characterized by the minimum distance to a set of useless resources under a proper distance measure. We give such characterization for all the tasks studied in this thesis, and find that the distance measure for the distillation and simulation process naturally corresponds to the quantum hypothesis testing relative entropy and the max-relative entropy, respectively.
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.