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

利用随机游动进行迭代相位估计

Using Random Walks for Iterative Phase Estimation

Cassandra Granade, Nathan Wiebe

摘要:

近年来,量子相位估计算法有了很大的发展。在这项工作中,我们提供了一种新的方法来在线贝叶斯相位估计,实现海森堡有限的缩放,需要指数更少的经典处理时间与所需的容错比现有的贝叶斯方法。这实际上意味着我们可以在CPU上执行微秒级的更新,而不是现有粒子滤波方法的毫秒级。我们的方法假设先验分布是高斯分布,并利用这样一个事实,当选择最佳实验时,先验分布的平均值由随机步行者的位置给出,其移动由测量结果决定。然后,我们认为从参数的基础上的Fisher信息,我们的算法提供了一个接近最佳的数据分析。这项工作表明,在线贝叶斯推断是实用的,有效的,并准备部署在现代FPGA驱动的自适应实验。

英文摘要:

In recent years there has been substantial development in algorithms for quantum phase estimation. In this work we provide a new approach to online Bayesian phase estimation that achieves Heisenberg limited scaling that requires exponentially less classical processing time with the desired error tolerance than existing Bayesian methods. This practically means that we can perform an update in microseconds on a CPU as opposed to milliseconds for existing particle filter methods. Our approach assumes that the prior distribution is Gaussian and exploits the fact, when optimal experiments are chosen, the mean of the prior distribution is given by the position of a random walker whose moves are dictated by the measurement outcomes. We then argue from arguments based on the Fisher information that our algorithm provides a near-optimal analysis of the data. This work shows that online Bayesian inference is practical, efficient and ready for deployment in modern FPGA driven adaptive experiments.

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

↑