arXiv:2610.05280
Quantum n-coloring is undecidable for every n 3
Christian Bo Kidmose-Frederiksen, Alfred Leth Nielsen
Abstract
The quantum $n$-coloring problem, given graph $G$, asks whether there exists a perfect quantum strategy for the $n$-coloring game of $G$. Previously it was known that quantum $n$-coloring is undecidable only for $n=3$. We extend this to all $n\geq 3$ with one elementary reduction. Letting $G'=(G\square K_3)\lor K_{n-3}$, we show that $G$ is quantum $3$-colorable if and only if $G'$ is quantum $n$-colorable.
AI Summary
Quantum $n$-coloring asks whether a graph admits a perfect quantum strategy for its $n$-coloring game, equivalently a finite-dimensional assignment of projections satisfying completeness and edge orthogonality. Undecidability was previously known for $n=3$, while the cases of fixed $n\ge4$ remained open. This paper establishes undecidability for every fixed $n\ge3$; quantum $1$- and $2$-colorability coincide with their classical counterparts and are decidable. The result follows from the polynomial-time reduction $G'=(G\square K_3)\vee K_{n-3}$, with $3|V(G)|+n-3$ vertices, and the equivalence $G\to_q K_3$ if and only if $G'\to_q K_n$. The forward construction cyclically permutes a quantum $3$-coloring across each three-vertex fibre and assigns separate colors to the added clique. Conversely, each fibre together with the added clique forms an $n$-clique. Completeness and orthogonality force the three projections associated with any fixed color in a fibre to sum to a projection independent of the fibre. Choosing a nonzero such projection and restricting to its range recovers a quantum $3$-coloring, in dimension no larger than the original strategy dimension. The reduction also applies to the commuting-operator model. The paper notes independent proofs of the undecidability result and a separate gapped version; its own argument concerns exact perfect-strategy existence. It does not resolve the general fixed-target quantum $H$-coloring problem, and states the conjecture that this problem is undecidable for every non-bipartite $H$.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.