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: CoRR (2023)
Keyphrases
- graph coloring
- distributed constraint optimization problems
- combinatorial problems
- phase transition
- job shop scheduling
- distributed sensor networks
- distributed breakout
- distributed environment
- distributed systems
- constraint satisfaction problems
- np complete problems
- max sat
- scheduling problem
- distributed constraint satisfaction problems
- neural network
- traveling salesman problem
- knapsack problem
- constraint satisfaction
- multi objective