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

量子算法用于路径和环包含问题

Quantum algorithms for path and cycle containment problems

Simons Institute, University of California Berkeley(加州大学伯克利分校西蒙斯研究所);QuICS, University of Maryland(马里兰大学量子信息与计算科学中心);Eindhoven University of Technology(埃因霍温理工大学)

Arjan Cornelissen, Amin Shiraz Gilani, Subhasree Patro

AI总结:

研究路径和环包含问题的量子查询复杂性,提出基于量子漫步的算法,改进了查询复杂度并给出下界。

摘要:

子图包含问题的量子查询复杂性已受到广泛关注。然而,即使对于相对简单的子图,如路径和环,对其查询复杂性的完全理解仍不明确。本文考虑了几种路径和环包含问题的变体,在邻接矩阵模型中搜索长度为常数k的路径或环。我们比较了有向和无向图的情况,以及检测或寻找路径/环存在性的目标,以及寻找恰好长度为k或至多长度为k的路径/环。我们还考虑了几种承诺版本的问题,假设输入图具有特定结构。通过随机化减少将这些变体的路径/环包含问题的难度进行比较,并将其分组为等价类。当专注于路径包含问题时,我们得到二元结果。一些路径包含问题可以使用线性数量的查询解决,而其他所有问题在随机化减少下等价于彼此(以及若干环包含问题),除了常数开销。对于后者等价类,我们证明了一个基于量子漫步的算法,其查询复杂度为~O(n^{3/2-α_k}),其中α_k∈Θ(c^{-k}),c=√(3+√17)/2≈1.33,优于之前的最佳上界O(n^{3/2})。我们还基于图碰撞问题提供了条件下界,表明除非图碰撞允许O(√n)查询算法,否则该等价类不接受线性查询量子算法。

英文摘要:

The quantum query complexity of subgraph-containment problems, which ask whether a given subgraph $H$ is present in an input graph $G$, has been the subject of considerable study. However, even for relatively simple subgraphs, such as paths and cycles, a complete understanding of their query complexities remains elusive. In this work, we consider several variants of path- and cycle-containment problems in the adjacency matrix model, where we search for paths or cycles of constant length $k$. We compare the settings where the graphs are directed or undirected, where the goal is to detect or find the existence of a path/cycle, and where the path/cycle we are looking for has length exactly $k$, or at most $k$. We also consider several promise versions of these problems, where we suppose that the input graph has a certain structure. We characterize the relative difficulty of these variants of the path/cycle-containment problems, by relating them to one another using randomized reductions, and grouping them into equivalence classes. When we restrict our attention to path-containment problems, we get a dichotomy result. Some of the path-containment problems can be solved using a linear number of queries, and all the others are equivalent to one another (and additionally to several cycle-containment problems) under randomized reductions, up to constant overhead. For the latter equivalence class, we prove a novel quantum-walk-based algorithm that achieves query complexity $\widetilde{O}(n^{3/2-α_k})$, where $α_k \in Θ(c^{-k})$ and $c = \sqrt{3+\sqrt{17}}/2 \approx 1.33$, beating the previous best upper bound $O(n^{3/2})$ on its query complexity. We also provide a conditional lower bound based on the graph-collision problem, which implies that this equivalence class does not admit linear-query quantum algorithms unless graph collision admits an $O(\sqrt{n})$ query algorithm.

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

↑