Quantum Algorithm for Approximating Maximum Independent Sets
Name
2005.13089.pdf
Description
Accepted version
Size
749.49 KB
Format
Adobe PDF
Checksum (MD5)
8547ccf7ba2938f5ad759933c715b15f
Author(s)
Yu, Hongye
Wilczek, Frank
Wu, Biao
Date Issued
2021
Journal
Chinese Physics Letters
Publisher
IOP Publishing
Citation
Yu, Hongye, Wilczek, Frank and Wu, Biao. 2021. "Quantum Algorithm for Approximating Maximum Independent Sets." Chinese Physics Letters, 38 (3).
Version
Author's final manuscript
Abstract
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 α(G) in low polynomial time. The best classical algorithms, by contrast, produce independent sets of size about half of α(G) in polynomial time.
MIT Department
Massachusetts Institute of Technology. Center for Theoretical Physics
Terms of Use
Attribution-NonCommercial-ShareAlike 4.0 International
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1088/0256-307X/38/3/030304
