### Parameter tuning patterns for random graph coloring with quantum annealing.

OPEN PloS one | 21 Nov 2012

###### O Titiloye and A Crispin

##### Abstract

Quantum annealing is a combinatorial optimization technique inspired by quantum mechanics. Here we show that a spin model for the k-coloring of large dense random graphs can be field tuned so that its acceptance ratio diverges during Monte Carlo quantum annealing, until a ground state is reached. We also find that simulations exhibiting such a diverging acceptance ratio are generally more effective than those tuned to the more conventional pattern of a declining and/or stagnating acceptance ratio. This observation facilitates the discovery of solutions to several well-known benchmark k-coloring instances, some of which have been open for almost two decades.

- Tweets*
- 0
- Facebook likes*
- 0
- Reddit*
- 0
- News coverage*
- 0
- Blogs*
- 0
- SC clicks
- 1
- Concepts
- Physics, Monte Carlo, Photon, Quantum electrodynamics, Quantum field theory, Quantum mechanics, Mathematics, Graph theory
- MeSH headings
- -

comments powered by Disqus

* Data courtesy of Altmetric.com