arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.13089quant-ph
收藏

Quantum Algorithm for Approximating Maximum Independent Sets

Hongye Yu, Frank Wilczek, Biao Wu

英文摘要:

We present a quantum algorithm for approximating maximum independent sets of a graph based on quantum non-Abelian adiabatic mixing in the sub-Hilbert space of degenerate ground states, which generates quantum annealing in a secondary Hamiltonian. For both sparse and dense graphs, our quantum algorithm on average can find an independent set of size very close to $α(G)$, which is the size of the maximum independent set of a given graph $G$. Numerical results indicate that an $O(n^2)$ time complexity quantum algorithm is sufficient for finding an independent set of size $(1-ε)α(G)$. The best classical approximation algorithm can produce in polynomial time an independent set of size about half of $α(G)$.

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

↑