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.
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.
In Bayesian estimation theory, the estimator θ^=E[θ∣l] attains the minimum mean squared error (MMSE) for estimating a scalar parameter of interest θ from the observation of l through a noisy channel Pl∣θ, given a prior Pθ on θ. In quantum sensing tasks, the user gets ρθ, the quantum state that encodes θ. They choose a measurement, a positive-operator valued measure (POVM) Πl, which induces the channel Pl∣θ=Tr(ρθΠl) to the measurement outcome l, on which the aforesaid classical MMSE estimator is employed. Personick found the optimum POVM Πl that minimizes the MMSE over all possible measurements, and that MMSE. This result from 1971 is less-widely known than the quantum Fisher information (QFI), which lower bounds the variance of an unbiased estimator over all measurements, when Pθ is unavailable. For multi-parameter estimation, i.e., when θ is a vector, in Fisher quantum estimation theory, the inverse of the QFI matrix provides an operator lower bound to the covariance of an unbiased estimator. However, there has been little work on quantifying quantum limits and measurement designs, for multi-parameter quantum estimation in the {\em Bayesian} setting. In this paper, we build upon Personick's result to construct a Bayesian adaptive measurement scheme for multi-parameter estimation when N copies of ρθ are available. We illustrate an application to localizing a cluster of point emitters in a highly sub-Rayleigh angular field-of-view, an important problem in fluorescence microscopy and astronomy. Our algorithm translates to a multi-spatial-mode transformation prior to a photon-detection array, with electro-optic feedback to adapt the mode sorter. We show that this receiver performs far superior to quantum-noise-limited focal-plane direct imaging.
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.
Abstract The quest for precision in parameter estimation is a fundamental task in different scientific areas. The relevance of this problem thus provided the motivation to develop methods for the application of quantum resources to estimation protocols. Within this context, Bayesian estimation offers a complete framework for optimal quantum metrology techniques, such as adaptive protocols. However, the use of the Bayesian approach requires extensive computational resources, especially in the multiparameter estimations that represent the typical operational scenario for quantum sensors. Hence, the requirement to characterize protocols implementing Bayesian estimations can become a significant challenge. This work focuses on the crucial task of robustly benchmarking the performances of these protocols in both single and multiple-parameter scenarios. By comparing different figures of merits, evidence is provided in favor of using the median of the quadratic error in the estimations in order to mitigate spurious effects due to the numerical discretization of the parameter space, the presence of limited data, and numerical instabilities. These results, providing a robust and reliable characterization of Bayesian protocols, find natural applications to practical problems within the quantum estimation framework.
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.
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.
Estimating multiple unknown parameters simultaneously is essential for practical quantum sensing. However, it faces a fundamental challenge: the optimal strategy for estimating one parameter is often incompatible with that for another, making it impossible to simultaneously achieve the ultimate precision limits for all parameters. Here we develop a general and efficient computational framework that jointly optimizes probe states, control operations, and measurements across different strategy families, including parallel, sequential, and those with indefinite causal order. Our approach provides exact semidefinite-program formulations for several precision bounds, including the Holevo, Nagaoka-Hayashi, and quantum Cramér-Rao bounds. We demonstrate the capabilities of the framework in multiparameter magnetometry and frequency estimation, identifying optimal protocols within each class and revealing a strict hierarchy among the achievable performances of different classes in the multiparameter regime. The framework also directly incorporates resource constraints, such as energy budgets, enabling systematic investigation of experimentally realistic sensing scenarios. Furthermore, we develop a finite-memory optimization method for sequential strategies with restricted ancillary-memory dimension. By decomposing the protocol into initial probe preparation and intermediate control operations, this method provides a practical route to designing resource-constrained sequential sensing schemes. Our work establishes a versatile computational tool for determining fundamental precision limits and designing optimal quantum-sensing protocols in complex multiparameter settings.