It is not known if there is there any graph problem that someone cares about for which there exist algorithm with distributed quantum advantage? For many gra

It is not known if there is there any graph problem that someone cares about for which there exist algorithm with distributed quantum advantage? For many graph problems it's possible show to show that there is no quantum advantage by by defining a model so that it can do anything except violating causality. This paper shows that approximate graph coloring has not quantum advantage.