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.
Comments
24 pages, 5 figures. A preliminary version of some of the results appeared in arXiv:2405.10525v2. This paper substantially expands those results and includes an additional author
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.
We present a comprehensive and pedagogical formulation of Bayesian multiparameter quantum estimation. Within this framework, we analyse the role of measurement incompatibility and establish its quantitative effect on attainable precision. We achieve this by deriving upper bounds based on the pretty good measurement -- a notion from hypothesis testing -- combined with the evaluation of the Nagaoka-Hayashi lower bound. In general, we prove that, as in the many-copy regime of local estimation theory, incompatibility can at most double the minimum loss relative to the idealised scenario in which individually optimal measurements are assumed jointly implementable. Therefore, in practical situations, the latter may provide a sufficient and computationally efficient benchmark without solving the full optimisation problem. Our results, which we illustrate through applications of discrete phase imaging, phase and dephasing estimation, and qubit sensing, provide analytical and numerical tools for assessing ultimate precision limits and the role of measurement incompatibility in Bayesian multiparameter quantum metrology, including an open-source package for all the bounds discussed here.
Multiparameter estimation remains a fundamental challenge in quantum estimation theory because the optimal measurements associated with different parameters are generally incompatible. In this work, we develop a Bayesian framework for the simultaneous estimation of multiple parameters. Our approach builds on Personick's method, in which the estimation problem is reduced to a set of Lyapunov equations whose solutions define optimal observables for the individual parameters. Since these observables generally do not commute, we construct a convex combination of the solutions, parameterized by a set of variational parameters. The spectral decomposition of the resulting operator defines a parametrized projection-valued measure. The resulting projective measurement determines the likelihood function, from which the minimum mean-square error estimators and the corresponding Bayesian mean-square errors are obtained, following standard Bayesian procedures, as functions of the variational parameters. To determine their optimal values, we formulate a minimax optimization problem based on the normalized Bayesian mean-square errors, introducing a min-max normalization procedure that enables a meaningful comparison of estimation errors associated with different parameters. This optimization yields a variationally optimized projective measurement for simultaneous Bayesian estimation. Two qubit examples, involving phase estimation and the estimation of parameters defining convex combinations of unitary operations, demonstrate the construction of optimized projective measurements and the corresponding minimum mean-square error estimators within the proposed framework for finite data sets.
Precise estimation of physical parameters underpins both scientific discovery and technological development. A central goal of quantum metrology and sensing is to exploit quantum resources like entanglement to devise optimal strategies for estimating physical parameters as precisely as possible. While substantial progress has been made in single-parameter quantum metrology, the multiparameter scenario remains significantly more challenging due to the issue of parameter incompatibility. In this work, we present a unified and computable approach for the simultaneous estimation of multiple parameters that attains the ultimate precision permitted by quantum mechanics. The core of our approach is to integrate the quantum tester formalism into the recently proposed tight Cramér-Rao type bound. This formulation enables us to figure out the highest achievable precision via upper and lower bounds that are computable via semidefinite programs. More importantly, within this formulation, diverse quantum resources, including entanglement, coherence, quantum control, and indefinite causal order, are treated on equal footing and systematically optimized for the purpose of achieving the ultimate precision in multiparameter estimation. As a result, our approach is applicable to various metrological strategies both in the presence and absence of noise. To demonstrate its utility, we revisit three-dimensional magnetic-field estimation, uncovering the strengths and limitations of existing analytical results and further establishing a strict hierarchy among different types of strategies.
Abstract Chapter 24 provides a compact introduction to the topic of quantum metrology, focusing on Hamiltonian parameter estimation in the frequentist and in the Bayesian paradigms. We first discuss how estimates of non-directly measurable quantities such as phases are obtained from measurement statistics in the frequentist approach. We then discuss the Cramér-Rao bound and the Fisher information and study single-qubit phase estimation in the light of this result. We then turn to the multi-qubit setting and discuss the quantum Cramér-Rao bound, for which the quantum Fisher information is the central quantity of interest. In this context we discuss the Uhlmann fidelity in detail. We further contrast Heisenberg scaling with the standard quantum limit in the phase-estimation scenario. Finally, we analyse phase estimation in the Bayesian-estimation approach and derive the van Trees inequality as a Bayesian version of the Cramér-Rao bound
We study lower bounds for Bayesian quantum parameter estimation, with a particular focus on qubit models. While several lower bounds on the Bayes risk have been proposed, including the Bayesian symmetric logarithmic derivative (B-SLD) type bound and the Bayesian Nagaoka-Hayashi (B-NH) bound, there is no definite proof available to show they are attainable except for special cases. Thus, identifying attainable bounds together with their corresponding optimal measurement strategies remains a central open problem in Bayesian quantum estimation. In this work, we introduce a new Bayesian lower bound, referred to as the Bayesian Gill-Massar (B-GM) bound, inspired by the logic of Gill-Massar bound in point estimation. We derive an analytical closed-form expression of the bound and show that it is attainable for any qubit model. In particular, we prove that the optimal Bayesian strategy can be realized by a projection-valued measure associated with a single effective direction determined by the weight matrix and the B-SLD-type Fisher information matrix. We provide numerical comparisons between the B-GM, B-NH, and B-SLD-type bounds in higher-dimensional models. Our results show that the B-GM bound has a limitation in high-dimensional models with few parameters, since it can be negative.
Bayesian quantum estimation provides a robust formalism for quantum technologies, particularly in scenarios with limited data and minimal prior information. Yet, its application to continuous-variable systems has remained limited and largely numerical due to the difficulty of the underlying parameter integrals. Here, we introduce a variational framework that restricts the optimisation over all measurements and estimators to a finite-dimensional subspace, reducing the problem to a linear system of equations with closed-form solutions. These solutions have a geometric interpretation as orthogonal projections of the global optimum onto the chosen subspace. For Gaussian states, a natural subspace is spanned by operators polynomial in the canonical quadratures, whose moments are computable from the first and second moments of the state. We further derive a necessary and sufficient condition for global optimality, and show that post-processing with the posterior mean, rather than using the estimator obtained from the subspace, improves performance towards the global optimum. Through single-shot examples, we show that the framework yields experimentally feasible strategies based on Gaussian operations and quadrature measurements that are either optimal or near-optimal.