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

一种基于查询的量子本征求解器

A Query-based Quantum Eigensolver

Shan Jin, Shaojun Wu, Guanyu Zhou, Ying Li, Lvzhou Li, Bo Li, Xiaoting Wang

AI总结:

本文提出一种利用定点量子搜索求解 II 型本征值问题的基于查询的量子本征求解器,分析初始态重叠与预言机构造,并证明其相对 QPE 具有二次加速。

摘要:

求解本征值问题对于经典和量子应用都至关重要。人们已经开发了许多著名的数值本征求解器,包括用于经典计算机的 QR 方法和幂方法,以及用于量子计算机的量子相位估计(QPE)方法和变分量子本征求解器。在本工作中,我们提出了另一种类型的量子方法,它使用定点量子搜索来求解 II 型本征值问题。它是对作为 I 型本征求解器的 QPE 方法的重要补充。我们发现,我们方法的有效性关键取决于对初始状态的适当选择,以保证与未知目标本征态有足够大的重叠。我们还表明,对于可高效模拟的 Hamilton 量,可以高效构造我们这种基于查询的方法的量子预言机,这对于分析总门复杂度至关重要。此外,与 QPE 方法相比,我们基于查询的方法在求解 II 型问题时实现了二次加速。

英文摘要:

Solving eigenvalue problems is crucially important for both classical and quantum applications. Many well-known numerical eigensolvers have been developed, including the QR and the power methods for classical computers, as well as the quantum phase estimation(QPE) method and the variational quantum eigensolver for quantum computers. In this work, we present an alternative type of quantum method that uses fixed-point quantum search to solve Type II eigenvalue problems. It serves as an important complement to the QPE method, which is a Type I eigensolver. We find that the effectiveness of our method depends crucially on the appropriate choice of the initial state to guarantee a sufficiently large overlap with the unknown target eigenstate. We also show that the quantum oracle of our query-based method can be efficiently constructed for efficiently-simulated Hamiltonians, which is crucial for analyzing the total gate complexity. In addition, compared with the QPE method, our query-based method achieves a quadratic speedup in solving Type II problems.

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

↑