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

关于早期容错量子计算机算法鲁棒性的证明

On proving the robustness of algorithms for early fault-tolerant quantum computers

Rutuja Kshirsagar, Amara Katabarwa, Peter D. Johnson

AI总结:

针对早期容错量子计算中缺少鲁棒性分析方法的问题,本文提出一种用于相位估计的随机算法,分析其在两种噪声模型下的性能并得出噪声阈值,还计算出电路深度与退相干尺度的最大比率为0.916。

摘要:

量子计算领域的希望是量子架构能够扩展并实现容错量子计算。由于工程挑战,这种“低成本”纠错可能还需要数十年时间。与此同时,我们预计会出现“高成本”纠错的时代,即早期容错量子计算。高成本纠错可能意味着要接受易出错的量子计算。这推动了对一定程度错误具有鲁棒性的量子算法的开发,以及分析其在存在错误时性能的方法。最近已开发出几种此类算法;缺少的是分析其鲁棒性的方法论。为此,我们引入了一种用于相位估计任务的随机算法,并分析了其在两种简单噪声模型下的性能。在这两种情况下,分析都得出了一个噪声阈值,低于该阈值时,通过增加算法中使用的样本数量可以实现任意高的精度。作为这种一般分析的应用,我们计算了最大电路深度与退相干尺度的比率,使得性能保证成立。我们计算出,只要所需的电路深度小于退相干尺度的0.916倍,随机算法就可以以任意高的概率成功。

英文摘要:

The hope of the quantum computing field is that quantum architectures are able to scale up and realize fault-tolerant quantum computing. Due to engineering challenges, such ''cheap'' error correction may be decades away. In the meantime, we anticipate an era of ''costly'' error correction, or early fault-tolerant quantum computing. Costly error correction might warrant settling for error-prone quantum computations. This motivates the development of quantum algorithms which are robust to some degree of error as well as methods to analyze their performance in the presence of error. Several such algorithms have recently been developed; what is missing is a methodology to analyze their robustness. To this end, we introduce a randomized algorithm for the task of phase estimation and give an analysis of its performance under two simple noise models. In both cases the analysis leads to a noise threshold, below which arbitrarily high accuracy can be achieved by increasing the number of samples used in the algorithm. As an application of this general analysis, we compute the maximum ratio of the largest circuit depth and the dephasing scale such that performance guarantees hold. We calculate that the randomized algorithm can succeed with arbitrarily high probability as long as the required circuit depth is less than 0.916 times the dephasing scale.

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

↑