Jul 2026
No Distributed Quantum Advantage for 3-Coloring Rooted Trees and 2-Coloring Even Cycles
It is shown that any algorithm in quantum-LOCAL (without pre-shared entanglement) that properly 3-colors 3-colors-node rooted trees with probability at least ${1-O(1/\log n)$ must perform $\Omega(\log^\star n)$ rounds, which is, quantum resources provide no advantage for 3-coloring rooted trees.
P. Fraigniaud, Frédéric Magniez, Isabella Ziccardi
· arXiv.org · 0 citations