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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IOP Publishing,
2022-05-04T17:56:25Z.
|
| Subjects: | |
| Online Access: | Get fulltext |