Abstract
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.
1 More- Received 14 June 2018
- Corrected 18 December 2018
DOI:https://doi.org/10.1103/PhysRevA.98.022301
©2018 American Physical Society
Physics Subject Headings (PhySH)
Corrections
18 December 2018
Correction: The definition for the ground-state population given in Eq. (10) and in the caption to Fig. 7 contained an error and has been fixed.