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

迈向无量子相干访问的速度提升

Toward speedup without quantum coherent access

C. N. Yang Institute for Theoretical Physics and Department of Physics and Astronomy, State University of New York at Stony Brook(纽约州立大学石溪分校杨振宁理论物理研究所及物理与天文学系)

Nhat A. Nghiem

AI总结:

本文提出了一种结合经典和量子资源的算法变种,通过块编码处理矩阵问题,实现对主成分分析、线性方程求解等任务的指数级加速,并提供端到端的数据拟合应用。

摘要:

随着量子技术的发展,寻找量子计算机的有用应用已成为核心追求。尽管已经开发出各种量子算法,但许多算法往往需要强输入假设,这对硬件提出了很高的要求。特别是最近的去量子化进展揭示了量子优势更多是强输入假设的产物。在本工作中,我们提出了一种这些算法的变种,利用了经典和量子资源。在提供矩阵/向量的 classical 知识(即条目)的情况下,使用经典过程对这些信息进行预处理。然后将它们输入到一个量子电路中,该电路被证明是所关注矩阵的块编码。从这个块编码中,我们展示了如何利用它来解决一系列问题,包括主成分分析、线性方程求解、哈密顿量模拟、制备基态以及数据拟合。我们还分析了我们的协议,证明经典和量子过程都可以在输入维度上实现对数复杂度,从而暗示了其在近期内实现的潜力。然后我们讨论了我们结果的几个影响和推论。首先,我们的结果表明,对于某些矩阵/哈密顿量,我们的方法相比现有方法在稀疏性方面可以提供指数级的改进。对于密集线性系统,我们的方法在误差容忍度的倒数方面相比现有最佳量子算法实现了指数级加速。最后,而且最重要的是,关于量子数据拟合,我们展示了如何利用我们的量子算法的输出来预测未见数据。因此,它提供了一个端到端的应用,这是之前量子数据拟合算法所缺乏的开放方面。

英文摘要:

Along with the development of quantum technology, finding useful applications of quantum computers has been a central pursuit. Despite various quantum algorithms have been developed, many of them often require strong input assumptions, which is hardware demanding. In particular, recent advances on dequantization have revealed that the quantum advantage is more of a mere artifact of strong input assumptions. In this work, we propose a variant of these algorithms, leveraging both classical and quantum resources. Provided the classical knowledge (the entries) of the matrix/vector of interest, a classical procedure is used to pre-process this information. Then they are fed into a quantum circuit which is shown to be a block encoding of the matrix of interest. From this block-encoding, we show how to use it to tackle a wide range of problems, including principal component analysis, linear equation solving, Hamiltonian simulation, preparing ground state, and data fitting. We also analyze our protocol, showing that both the classical and quantum procedure can achieve logarithmic complexity in the input dimension, thus implying its potential for near term realization. We then discuss several implications and corollaries of our result. First,, our results suggest there are certain matrices/Hamiltonians where our method can provide exponential improvement compared to the existing ones with respect to the sparsity. Regarding dense linear systems, our method achieves exponential speed-up with respect to the inverse of error tolerance, compared to the best previously known quantum algorithm for dense systems. Last, and most importantly, regarding quantum data fitting, we show how the output of our quantum algorithms can be leveraged to predict unseen data. Thus, it provides an end-to-end application, which has been an open aspect of the previous quantum data fitting algorithm.

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

↑