.png){kind=icon}
返回
Quantum Algorithm for Approximating Maximum Independent Sets
.png){kind=icon}
OA
AI
DOI：10.1088/0256-307X/38/3/030304.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 random graphs G, numerical simulation suggests that our algorithm on average finds an independent set of size close to the maximum size alpha(G) in low polynomial time. The best classical algorithms, by contrast, produce independent sets of size about half of alpha(G) in polynomial time.
期刊
IF:
4.2
论文数:
9.1K
被引数:
7.7K
机构
查看更多机构
引用论文
.png){kind=icon}
分享收藏Pollen analysis of mangrove sediments as a sea-level indicator: assessment from Tongatapu, Tonga
PREAI
分享收藏 没有更多内容