arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1912.02728cs.DScs.CCquant-ph
收藏

基于连续时间量子行走的最大团算法

Algorithm for Finding the Maximum Clique Based on Continuous Time Quantum Walk

Xi Li, Mingyou Wu, Hanwu Chen

摘要:

在这项工作中,我们考虑应用连续时间量子行走(CTQW)的最大团(MC)问题。在图上执行CTQW将为不同的顶点生成不同的周期概率幅度。我们将证明概率幅在频率上的强度确实包含某些特殊类型的图的团结构。并给出了经典计算机中时间复杂度为$O(N^5)$的求最大团的递归算法。我们已经在随机图上进行了实验,其中每个边存在的概率为0.3,0.5和0.7。虽然没有找到随机图的反例,但这些算法是否具有普适性还不清楚。

英文摘要:

In this work, we consider the application of continuous time quantum walking(CTQW) to the Maximum Clique(MC) Problem. Performing CTQW on graphs will generate distinct periodic probability amplitude for different vertices. We will show that the intensity of the probability amplitude at frequency indeed implies the clique structure of some special kinds of graph. And recursive algorithms with time complexity $O(N^5)$ in classical computers for finding the maximum clique are proposed. We have experimented on random graphs where each edge exists with probabilities 0.3, 0.5 and 0.7. Although counter examples are not found for random graphs, whether these algorithms are universal is not known to us.

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

↑