arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.14495quant-ph
收藏

少测量次数下参数估计的基本界限

Fundamental bounds for parameter estimation with few measurements

Valentin Gebhart, Manuel Gessner, Augusto Smerzi

AI总结:

本文研究少测量或低信噪比下参数估计的最优精度界限,分析类Barankin线性条件何时允许有限方差最优估计量,并推导扩展Cramér-Rao bound以弥补Barankin bound未定义的情形。

摘要:

界定参数估计任务中的最优精度对于技术应用至关重要。在测量次数较少或信噪比较低的区域中,常见频率学派界限(如Cramér-Rao bound,CRB)的含义变得可疑。在此,我们讨论了可施加于估计量的不同线性(类Barankin)条件,并分析了对于任意测量重复次数,这些条件何时允许存在具有有限方差的最优估计量。我们证明,如果所施加条件的数量大于测量结果的数量,则通常不存在具有有限方差的相应估计量。我们从不同视角和示例分析了这一结果,并详细阐述了其与散粒噪声极限以及Kitaev相位估计算法的联系。随后,我们推导出一个扩展的Cramér-Rao bound,在Barankin bound未定义的情况下,该扩展界限与有限方差相容。最后,我们展示了频率学派与贝叶斯参数估计方法之间的一个示例性数值对比。

英文摘要:

Bounding the optimal precision in parameter estimation tasks is of central importance for technological applications. In the regime of a small number of measurements, or that of low signal-to-noise ratios, the meaning of common frequentist bounds such as the Cramér-Rao bound (CRB) become questionable. Here, 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, for any number of measurement repetitions. 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 analyze this result from different viewpoints and examples and elaborate on connections to the shot-noise limit and the Kitaev phase estimation algorithm. We then derive an extended Cramér-Rao bound that is compatible with a finite variance in situations where the Barankin bound is undefined. Finally, we show an exemplary numerical confrontation between frequentist and Bayesian approaches to parameter estimation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑