Solving Multi-Coloring Combinatorial Optimization Problems Using Hybrid Quantum Algorithms

The design of a good algorithm to solve NP-hard combinatorial approximation problems requires specific domain knowledge about the problems and often needs a trial-and-error problem solving approach. Graph coloring is one of the essential fields to provide an efficient solution for combinatorial appl...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2019-12
Hauptverfasser:	Young-Hyun, Oh, Mohammadbagherpoor, Hamed, Dreher, Patrick, Singh, Anand, Yu, Xianqing, Rindos, Andy J
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Combinatorial analysis Graph coloring Ising model Optimization Polynomials Problem solving Quantum computing Register allocation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!