arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2303.03319quant-phcs.DS
收藏

路径边采样的量子算法

Quantum Algorithm for Path-Edge Sampling

Stacey Jeffery, Shelby Kimmel, Alvaro Piedrafita

AI总结:

本研究提出一种路径边采样量子算法,其查询复杂度与路径检测复杂度渐近一致,可作为子例程用于st路径与割集查找,核心贡献是生成与张成程序正见证向量成正比量子态的算法。

摘要:

我们提出一种量子算法,用于在以邻接矩阵形式给出的无向图中,采样两个节点s与t之间某条路径上的一条边,并证明该算法的查询复杂度(至多相差对数因子)与检测s和t之间是否存在路径的查询复杂度渐近一致。我们将该路径采样算法作为子例程,应用于特定场景下的st路径查找和st割集查找算法中。我们的核心技术贡献是一种生成与张成程序(span program)正见证向量成正比的量子态的算法。

英文摘要:

We present a quantum algorithm for sampling an edge on a path between two nodes s and t in an undirected graph given as an adjacency matrix, and show that this can be done in query complexity that is asymptotically the same, up to log factors, as the query complexity of detecting a path between s and t. We use this path sampling algorithm as a subroutine for st-path finding and st-cut-set finding algorithms in some specific cases. Our main technical contribution is an algorithm for generating a quantum state that is proportional to the positive witness vector of a span program.

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

↑