arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2611.06751quant-phcs.DS
收藏

三角形查找的量子下界

A Quantum Lower Bound for Triangle Finding

University of Cambridge(剑桥大学);Joint Center for Quantum Information and Computer Science, University of Maryland(马里兰大学量子信息与计算机科学联合中心);The University of British Columbia(不列颠哥伦比亚大学)

Arjan Cornelissen, Amin Shiraz Gilani, Xingyu Zhou

AI总结:

该研究证明三角形查找存在首个超线性量子查询下界Ω(N^(13/12)),其方法基于压缩oracle与转移方法,还推导了三角形检测等问题的相同下界。

摘要:

三角形查找是图论中的一个基础问题,在量子算法技术的发展中占据核心地位。对于由邻接矩阵给出的N顶点图,一系列研究已将量子查询上界从O(N^(3/2))改进至O(N^(5/4)),但目前已知的最佳下界仍为非结构化搜索得到的初等Ω(N)下界。我们证明了三角形查找的首个超线性量子查询下界,表明需要Ω(N^(13/12))次查询。我们的结果还意味着三角形检测以及每个固定连通非二分图检测都具有相同的下界。该证明基于Zhandry的压缩oracle方法和Belovs的转移方法,通过输入寄存器上的一个与每个查询几乎可交换的映射,对比植入三角形的图上的计算与条件为无三角形的随机图上的计算。我们通过一种称为条件重采样的过程,在保留输入分布的同时对输入的局部变化取平均。我们的主要技术贡献是一组估计,尽管由稠密图条件为无三角形引入了依赖性,这些估计仍能让我们控制该平均下的查询误差。

英文摘要:

Triangle finding is a fundamental problem in graph theory that has played a central role in the development of quantum algorithmic techniques. For $N$-vertex graphs given by their adjacency matrices, a long line of work has improved the quantum query upper bound from $O(N^{3/2})$ to $O(N^{5/4})$. However, the best known lower bound has remained the elementary $Ω(N)$ bound obtained from unstructured search. We prove the first superlinear quantum query lower bound for triangle finding, showing that $Ω(N^{13/12})$ queries are necessary. Our result also implies the same lower bound for triangle detection and for detecting every fixed connected non-bipartite graph. The proof builds on the compressed oracle approach of Zhandry and the transfer approaches of Belovs. It compares the computation on graphs with a planted triangle to the computation on random graphs conditioned to be triangle-free, through a map on the input registers that almost commutes with every query. We average over local changes to the input while preserving its distribution, through a procedure known as conditional resampling. Our main technical contribution is a set of estimates that let us control the query error under this averaging, despite the dependence introduced by conditioning a dense graph to be triangle-free.

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

↑