有向$st$-连通性的量子时间-空间权衡
A Quantum Time-Space Tradeoff for Directed $st$-Connectivity
AI总结:
针对有向st-连通性问题,提出一种量子算法,在空间S≥log²(n)下,时间T≤2^(½log(n)log(n/S)+o(log²(n))),较经典算法有至多二次改进,且仅O(log²(n))为量子空间,实现经典空间与量子时间的权衡。
摘要:
有向$st$-连通性(DSTCON)是判定输入有向图中一对指定顶点$s$和$t$之间是否存在有向路径的问题。该问题出现在许多算法应用中,同时也是复杂性理论中的一个基本问题,因为它具有${\sf NL}$完全性。我们证明,对于任意$S\geq \log^2(n)$,存在一个使用空间$S$和时间$T\leq 2^{\frac{1}{2}\log(n)\log(n/S)+o(\log^2(n))}$的量子算法来解决DSTCON,对于任何$S=o(\sqrt{n})$,该算法相比最佳经典算法有(最多二次的)改进。在我们算法使用的总空间$S$中,只有$O(\log^2(n))$是量子空间,其余是经典空间。这实际上意味着我们可以用经典空间来换取量子时间。
英文摘要:
Directed $st$-connectivity (DSTCON) is the problem of deciding if there exists a directed path between a pair of distinguished vertices $s$ and $t$ in an input directed graph. This problem appears in many algorithmic applications, and is also a fundamental problem in complexity theory, due to its ${\sf NL}$-completeness. We show that for any $S\geq \log^2(n)$, there is a quantum algorithm for DSTCON using space $S$ and time $T\leq 2^{\frac{1}{2}\log(n)\log(n/S)+o(\log^2(n))}$, which is an (up to quadratic) improvement over the best classical algorithm for any $S=o(\sqrt{n})$. Of the $S$ total space used by our algorithm, only $O(\log^2(n))$ is quantum space - the rest is classical. This effectively means that we can trade off classical space for quantum time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。