Cargando…
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...
Autores principales: | Titiloye, Olawale, Crispin, Alan |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2012
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3498173/ https://www.ncbi.nlm.nih.gov/pubmed/23166818 http://dx.doi.org/10.1371/journal.pone.0050060 |
Ejemplares similares
-
Experimental quantum annealing: case study involving the graph isomorphism problem
por: Zick, Kenneth M., et al.
Publicado: (2015) -
Greedy parameter optimization for diabatic quantum annealing
por: Kadowaki, Tadashi, et al.
Publicado: (2023) -
Fine-Tuning and Optimization of Superconducting Quantum Magnetic Sensors by Thermal Annealing
por: Vettoliere, Antonio, et al.
Publicado: (2019) -
All‐in‐One Process for Color Tuning and Patterning of Perovskite Quantum Dot Light‐Emitting Diodes
por: Kim, Junho, et al.
Publicado: (2022) -
Graph coloring using the reduced quantum genetic algorithm
por: Ardelean, Sebastian Mihai, et al.
Publicado: (2022)