Metraipolis › archive › dc_61ba09243ebd

Quantum n-coloring is undecidable for every n $\ge$ 3 — arXiv:2610.05280

Source: arXiv (en)
Original: https://arxiv.org/abs/2610.05280
License (as archived): CC0-1.0
Archived: 2026-10-06T16:53:20.383Z
SHA-256 of the archived text: 16e0e0ce154c6a60f3727766a2fdfbd0d1c4eb6911a4441e87947ede63733aca
Stable URL of this page: https://metraipolis.com/documento/dc_61ba09243ebd

How to cite

Quantum n-coloring is undecidable for every n $\ge$ 3 — arXiv:2610.05280 — arXiv (en), https://arxiv.org/abs/2610.05280 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_61ba09243ebd (Metraipolis archive dc_61ba09243ebd, sha256 16e0e0ce154c6a60f3727766a2fdfbd0d1c4eb6911a4441e87947ede63733aca)

BibTeX

@misc{dc61ba09243ebd,
  title = {Quantum n-coloring is undecidable for every n $ge$ 3 — arXiv:2610.05280},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.05280},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_61ba09243ebd; sha256 16e0e0ce154c6a60f3727766a2fdfbd0d1c4eb6911a4441e87947ede63733aca},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.05280. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.05280 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T15:19:20.065Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).