Parameter tuning patterns for random graph coloring with quantum annealing.
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...
Main Authors: | Olawale Titiloye, Alan Crispin |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2012-01-01
|
Series: | PLoS ONE |
Online Access: | http://europepmc.org/articles/PMC3498173?pdf=render |
Similar Items
-
Optimization by quantum annealing for the graph colouring problem
by: Titiloye, Olawale
Published: (2013) -
Fine-Tuning and Optimization of Superconducting Quantum Magnetic Sensors by Thermal Annealing
by: Antonio Vettoliere, et al.
Published: (2019-08-01) -
Quantum annealing algorithms for track pattern recognition
by: Saito Masahiko, et al.
Published: (2020-01-01) -
Tuning parameters in random forests
by: Scornet Erwan
Published: (2017-01-01) -
Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors
by: Ching-Chen Kuo, et al.
Published: (2009)