Bayesian approach to simultaneous quantum multiparameter estimation with finite data
- URL: http://arxiv.org/abs/2608.10230v1
- Date: Mon, 10 Aug 2026 21:07:13 GMT
- Title: Bayesian approach to simultaneous quantum multiparameter estimation with finite data
- Abstract summary: This work builds on Personick's method, in which the estimation problem is reduced to a set of Lyapunov equations.<n>We construct a convex combination of the solutions, parameterized by a set of variational parameters.<n>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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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.
Related papers
- Efficient Covariance Estimation for Sparsified Functional Data [51.69796254617083]
proposed Random-knots (Random-knots-Spatial) and B-spline (Bspline-Spatial) estimators of the covariance function are computationally efficient.<n>Asymptotic pointwise of the covariance are obtained for sparsified individual trajectories under some regularity conditions.
arXiv Detail & Related papers (2025-11-23T00:50:33Z) - The Most Informative Cramér--Rao Bound for Quantum Two-Parameter Estimation with Pure State Probes [0.0]
We present a new expression for the achievable bound for two- parameter estimation with pure states.<n>We also determine the optimal measurements.<n>To demonstrate the utility of our result, we determine the precision limit for estimating displacements using grid states.
arXiv Detail & Related papers (2025-11-18T22:15:14Z) - On the Optimal Construction of Unbiased Gradient Estimators for Zeroth-Order Optimization [57.179679246370114]
A potential limitation of existing methods is the bias inherent in most perturbation estimators unless a stepsize is proposed.<n>We propose a novel family of unbiased gradient scaling estimators that eliminate bias while maintaining favorable construction.
arXiv Detail & Related papers (2025-10-22T18:25:43Z) - Debiased Ill-Posed Regression [8.495265117285223]
We propose a debiased estimation strategy based on the influence function of a modification of the projected error.<n>Our proposed estimator possesses a second-order bias with respect to the involved nuisance functions.
arXiv Detail & Related papers (2025-05-27T06:47:33Z) - Scrambling for precision: optimizing multiparameter qubit estimation in the face of sloppiness and incompatibility [0.0]
We explore the connection between sloppiness and incompatibility by introducing an adjustable scrambling operation for parameter encoding.<n>Through analytical optimization, we identify strategies to mitigate these constraints and enhance estimation efficiency.
arXiv Detail & Related papers (2025-03-11T09:57:51Z) - Multivariate root-n-consistent smoothing parameter free matching estimators and estimators of inverse density weighted expectations [51.000851088730684]
We develop novel modifications of nearest-neighbor and matching estimators which converge at the parametric $sqrt n $-rate.<n>We stress that our estimators do not involve nonparametric function estimators and in particular do not rely on sample-size dependent parameters smoothing.
arXiv Detail & Related papers (2024-07-11T13:28:34Z) - Scaling Exponents Across Parameterizations and Optimizers [94.54718325264218]
We propose a new perspective on parameterization by investigating a key assumption in prior work.
Our empirical investigation includes tens of thousands of models trained with all combinations of threes.
We find that the best learning rate scaling prescription would often have been excluded by the assumptions in prior work.
arXiv Detail & Related papers (2024-07-08T12:32:51Z) - Fundamental bounds for parameter estimation with few measurements [0.0]
We discuss different linear (Barankin-like) conditions that can be imposed on estimators and analyze when these conditions admit an optimal estimator with finite variance.
We show that, if the number of imposed conditions is larger than the number of measurement outcomes, there generally does not exist a corresponding estimator with finite variance.
We derive an extended Cram'er-Rao bound that is compatible with a finite variance in situations where the Barankin bound is undefined.
arXiv Detail & Related papers (2024-02-22T12:40:08Z) - Designing optimal protocols in Bayesian quantum parameter estimation with higher-order operations [0.0]
A major task in quantum sensing is to design the optimal protocol, i.e., the most precise one.
Here, we focus on the single-shot Bayesian setting, where the goal is to find the optimal initial state of the probe.
We leverage the formalism of higher-order operations to develop a method that finds a protocol that is close to the optimal one with arbitrary precision.
arXiv Detail & Related papers (2023-11-02T18:00:36Z) - Optimization of Annealed Importance Sampling Hyperparameters [77.34726150561087]
Annealed Importance Sampling (AIS) is a popular algorithm used to estimates the intractable marginal likelihood of deep generative models.
We present a parameteric AIS process with flexible intermediary distributions and optimize the bridging distributions to use fewer number of steps for sampling.
We assess the performance of our optimized AIS for marginal likelihood estimation of deep generative models and compare it to other estimators.
arXiv Detail & Related papers (2022-09-27T07:58:25Z) - Variable selection for Gaussian process regression through a sparse
projection [0.802904964931021]
This paper presents a new variable selection approach integrated with Gaussian process (GP) regression.
The choice of tuning parameters and the accuracy of the estimation are evaluated with the simulation some chosen benchmark approaches.
arXiv Detail & Related papers (2020-08-25T01:06:10Z) - Optimal Bayesian experimental design for subsurface flow problems [77.34726150561087]
We propose a novel approach for development of chaos expansion (PCE) surrogate model for the design utility function.
This novel technique enables the derivation of a reasonable quality response surface for the targeted objective function with a computational budget comparable to several single-point evaluations.
arXiv Detail & Related papers (2020-08-10T09:42:59Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.