Constrained quantum annealing of graph coloring

Research output: Contribution to journalArticlepeer-review

19 Citations (Scopus)


We investigate a quantum annealing approach based on real-time quantum dynamics for graph coloring. In this approach, a driving Hamiltonian is chosen so that constraints are naturally satisfied without penalty terms and the dimension of the Hilbert space is considerably reduced. The total Hamiltonian, which consists of driving and problem Hamiltonians, resembles a disordered quantum spin chain. The ground state of the problem Hamiltonian for graph coloring is degenerate. This degeneracy is advantageous and is characteristic of this approach. Real-time quantum simulations in a small system demonstrate interesting results and provide some insight into quantum annealing.

Original languageEnglish
Article number022301
JournalPhysical Review A
Issue number2
Publication statusPublished - 2018 Aug 1


Dive into the research topics of 'Constrained quantum annealing of graph coloring'. Together they form a unique fingerprint.

Cite this