No Distributed Quantum Advantage for Approximate Graph Coloring.
Xavier Coiteux-RoyFrancesco D'AmoreRishikesh GajjalaFabian KuhnFrançois Le GallHenrik LievonenAugusto ModaneseMarc-Olivier RenouGustav SchmidJukka SuomelaPublished in: STOC (2024)
Keyphrases
- graph coloring
- distributed constraint optimization problems
- distributed sensor networks
- combinatorial problems
- np complete problems
- distributed breakout
- job shop scheduling
- distributed systems
- phase transition
- constraint satisfaction problems
- hyper heuristics
- distributed environment
- scheduling problem
- max sat
- np complete
- neural network
- evolutionary algorithm