Sufficient support size of measurements for quantum estimation

Abstract:In quantum estimation for a $d$-parameter family of density operators on a finite-dimensional Hilbert space $\mathcal{H}$, an estimator is specified by a pair $\left(M,\hat{\theta}\right)$, where $M$ is a POVM with a finite outcome set $\Omega$ and $\hat{\theta}:\Omega\to\mathbb{R}^{d}$ is a classical estimator map. Since the number of outcomes $\left|\Omega\right|$ is a priori unbounded, the space of admissible POVMs is vast, which makes the search for optimal estimators difficult. In this paper, for the minimization of the weighted trace of the mean squared error among locally unbiased estimators, we prove that it suffices to consider POVMs with at most $\left(\dim\mathcal{H}\right)^{2}+d(d+1)/2-1$ outcomes, and that the optimization can be restricted to rank-one measurements. For Bayesian estimation with a general loss function, we show that rank-one POVMs with at most $(\dim\mathcal{H})^{2}$ outcomes are sufficient for the infimum value of the Bayes risk. Furthermore, when the model admits a real sufficient subalgebra, we show that the $\left(\dim\mathcal{H}\right)^{2}$ term in the above support-size bounds can be reduced in both the locally unbiased and Bayesian settings. These bounds substantially reduce the search space for optimal measurements and justify restricting numerical optimization to rank-one POVMs with finitely many outcomes.

arXiv:2604.21323 [quant-ph]

(or arXiv:2604.21323v3 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2604.21323 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.