.png){kind=icon}
Return
Quantum Algorithm for Approximating Maximum Independent Sets
.png){kind=icon}
OA
AI
DOI：10.1088/0256-307X/38/3/030304.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Journal
IF:
4.2
Papers:
9.1K
Citations:
7.7K
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSavePollen analysis of mangrove sediments as a sea-level indicator: assessment from Tongatapu, Tonga
PREAI
ShareSave no more