Metraipolis › archive › dc_444ea8a7f9bb
A Quantum Framework for K Coloring of Graphs — arXiv:2609.32348
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.32348
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T00:45:06.240Z
- SHA-256 of the archived text
e4336ac109917dad86745e775386f2c49e9bc5a3aef6fbbaccb05988a8cd91d7- Stable URL of this page
https://metraipolis.com/documento/dc_444ea8a7f9bb
How to cite
A Quantum Framework for K Coloring of Graphs — arXiv:2609.32348 — arXiv (en), https://arxiv.org/abs/2609.32348 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_444ea8a7f9bb (Metraipolis archive dc_444ea8a7f9bb, sha256 e4336ac109917dad86745e775386f2c49e9bc5a3aef6fbbaccb05988a8cd91d7)
BibTeX
@misc{dc444ea8a7f9bb,
title = {A Quantum Framework for K Coloring of Graphs — arXiv:2609.32348},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.32348},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_444ea8a7f9bb; sha256 e4336ac109917dad86745e775386f2c49e9bc5a3aef6fbbaccb05988a8cd91d7},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.32348. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Graph coloring is a well-known NP-complete problem with applications in scheduling, register allocation, frequency assignment, and network optimization. Quantum computing offers the potential for polynomial or even super-polynomial speedups in certain problem instances, yet practical quantum graph coloring methods must carefully balance qubit resources, circuit depth, and constraint enforcement. We proposed a solver agnostic quantum framework for $K$-coloring. Along with a novel encoding and efficient constraint implementation for its exact coloring exploiting Grover search and almost optimal coloring by the Quantum Approximate Optimization Algorithm \emph{(QAOA)}, and \emph{Quantum Annealing}. Unlike using $O(NK)$ qubits as in \emph{SOTA}, we reduced the qubit requirements to $O(N \log_2 K)$, along with optimized comparator circuits enforcing adjacency constraints. Further symmetry-based graph reduction is incorporated as an optional preprocessing step to further reduce the instance size before quantum execution.
Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-29 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.32348 — 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-08T00:19:23.346Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).