量子算法和遗忘的力量
Quantum algorithms and the power of forgetting
摘要:
所谓的焊接树问题提供了一个黑箱问题的例子,可以通过量子行走比任何经典算法以指数速度解决。给定一个特殊的入口顶点的名称,量子行走可以使用多项式多个查询找到另一个独特的出口顶点,尽管没有找到从入口到出口的任何特定路径。20年来,是否存在一种有效的量子算法来寻找这样的路径,或者即使对于量子计算机来说,路径寻找问题也很难,这一直是一个悬而未决的问题。我们证明了一个自然类的有效的量子算法可证明不能找到一个路径从入口到出口。具体来说,我们考虑的算法,在每个分支的叠加,总是存储一组顶点标签,形成一个连接的子图,包括入口,并只提供这些顶点标签作为输入的oracle。虽然这并不排除量子算法有效找到路径的可能性,但目前还不清楚算法如何通过偏离这种行为而受益。我们的不可行结果表明,对于某些问题,量子算法必须忘记它们到达解决方案的路径,以便优于经典计算。
英文摘要:
The so-called welded tree problem provides an example of a black-box problem that can be solved exponentially faster by a quantum walk than by any classical algorithm. Given the name of a special ENTRANCE vertex, a quantum walk can find another distinguished EXIT vertex using polynomially many queries, though without finding any particular path from ENTRANCE to EXIT. It has been an open problem for twenty years whether there is an efficient quantum algorithm for finding such a path, or if the path-finding problem is hard even for quantum computers. We show that a natural class of efficient quantum algorithms provably cannot find a path from ENTRANCE to EXIT. Specifically, we consider algorithms that, within each branch of their superposition, always store a set of vertex labels that form a connected subgraph including the ENTRANCE, and that only provide these vertex labels as inputs to the oracle. While this does not rule out the possibility of a quantum algorithm that efficiently finds a path, it is unclear how an algorithm could benefit by deviating from this behavior. Our no-go result suggests that, for some problems, quantum algorithms must necessarily forget the path they take to reach a solution in order to outperform classical computation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。