Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Discrete Optimization

Quantum annealing of the graph coloring problem

Olawale Titiloye, Alan J. Crispin

Published Jan 8, 2011• 109 citations
Publisher
DOI
10.1016/j.disopt.2010.12.001

Related papers

Mapping graph coloring to quantum annealing

CARLA VANESSA DA SILVA, Ana Aguiar, Priscila M. V. Lima +1 more

Quantum Machine Intelligence•Nov 16, 2020•22 citations

Graph Coloring with a Distributed Hybrid Quantum Annealing Algorithm

Olawale Titiloye, Alan J. Crispin

Lecture notes in computer science•Jan 1, 2011•28 citations

Exponential-Time Quantum Algorithms for Graph Coloring Problems

Kazuya Shimizu, Ryuhei Mori

Lecture notes in computer science•Jan 1, 2020•8 citations

Exponential-Time Quantum Algorithms for Graph Coloring Problems

一矢 清水, Shimizu, Kazuya, 立平 森 +1 more

•May 1, 2020•0 citations

Efficient Hybridization of Quantum Annealing and Ant Colony Optimization for Coloring DIMACS Graph Instances

Arnab Kole, Anindya Jyoti Pal

Journal of Heuristics•Aug 2, 2025•3 citations

Quantum Circuit Compilation for the Graph Coloring Problem

Angelo Oddi, Riccardo Rasconi, Marco Baioletti +2 more

Lecture notes in computer science•Jan 1, 2023•3 citations