arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2401.14932quant-ph
收藏

球心寻找问题中样本复杂度的无界量子-经典分离

Unbounded quantum-classical separation in sample complexity for sphere center finding

Sun Yat-sen University(中山大学);Quantum Science Center of Guangdong-Hong Kong-Macao Greater Bay Area(粤港澳大湾区量子科学中心)

Guanzhong Li, Lvzhou Li

AI总结:

本文证明在有限域向量空间中寻找球心,经典算法需样本数与维数相当,而基于量子行走的量子算法仅需常数样本,揭示无界量子优势。

摘要:

快速量子算法可以比经典算法更高效地解决重要的计算问题。然而,关于量子计算能否加速解决几何问题,目前所知甚少。本文探讨了在有限域上的向量空间中,给定球面上随机点的样本,寻找球心这一问题的量子优势。我们证明,任何经典算法完成此任务所需的样本数量大约等于向量空间的维数,这是通过归约到一个古老而基础的代数结果——Warning第二定理来实现的。另一方面,我们提出了一种基于量子行走的量子算法,仅需常数个样本即可找到球心。因此,对于一个自然且直观的几何问题,揭示了无界的量子优势,这凸显了量子计算在解决几何问题方面的强大能力。

英文摘要:

Fast quantum algorithms can solve important computational problems more efficiently than classical algorithms. However, little is known about whether quantum computing can speed up solving geometric problems. This article explores quantum advantages for the problem of finding the center of a sphere in vector spaces over finite fields, given samples of random points on the sphere. We prove that any classical algorithm for this task requires approximately as many samples as the dimension of the vector space, by a reduction to an old and basic algebraic result -- Warning's second theorem. On the other hand, we propose a quantum algorithm based on quantum walks that needs only a constant number of samples to find the center. Thus, an unbounded quantum advantage is revealed for a natural and intuitive geometric problem, which highlights the power of quantum computing in solving geometric problems.

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

↑