Quantum Algorithm for Approximating Maximum Independent Sets

Quantum Algorithm for Approximating Maximum Independent Sets

<jats:p>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...

Full description

Bibliographic Details
Main Authors: Yu, Hongye, Wilczek, Frank, Wu, Biao
Other Authors: Massachusetts Institute of Technology. Center for Theoretical Physics
Format: Article
Language:English
Published: IOP Publishing 2022
Online Access:https://hdl.handle.net/1721.1/142336

Internet

https://hdl.handle.net/1721.1/142336

Similar Items