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

无QFT的加速量子振幅估计

Accelerated Quantum Amplitude Estimation without QFT

Alet Roux, Tomasz Zastawniak

AI总结:

提出一种无需量子傅里叶变换的量子振幅估计算法,通过更小常数实现 $O(1/\varepsilon)$ 量子计算复杂度,并利用计算机辅助估计获得更紧上界,整体性能优于现有方法。

摘要:

我们提出了一种量子振幅估计算法,与现有方法相比,它具有更优的性能(更低的量子计算复杂度和更快的经典计算部分)。该算法不依赖量子傅里叶变换,其量子计算复杂度在目标精度 $\varepsilon>0$ 下为 $O(\frac{1}{\varepsilon})$ 阶。由于常数更小,其量子计算复杂度的 $O(\frac{1}{\varepsilon})$ 上限也优于早期方法。此外,通过计算机辅助估计量子计算复杂度的期望值,获得了更紧的上界。算法的正确性及量子计算复杂度的 $O(\frac{1}{\varepsilon})$ 上界均有精确证明支持。

英文摘要:

We put forward a Quantum Amplitude Estimation algorithm delivering superior performance (lower quantum computational complexity and faster classical computation parts) compared to the approaches available to-date. The algorithm does not relay on the Quantum Fourier Transform and its quantum computational complexity is of order $O(\frac{1}{\varepsilon})$ in terms of the target accuracy $\varepsilon>0$. The $O(\frac{1}{\varepsilon})$ bound on quantum computational complexity is also superior compared to those in the earlier approaches due to smaller constants. Moreover, a much tighter bound is obtained by means of computer-assisted estimates for the expected value of quantum computational complexity. The correctness of the algorithm and the $O(\frac{1}{\varepsilon})$ bound on quantum computational complexity are supported by precise proofs.

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

↑