A Quantum Framework for K Coloring of Graphs

arXiv:2609.32348 · quant-ph · Submitted 2026-09-26 · Read on arXiv

quant-ph

Submitted: 2026-09-26

Updated: 2026-09-26

Terminology

• Quantum Annealing — 11× in this paper
• Ancilla Qubits — 3× in this paper · explained in 1 episode
• Quantum Approximate Optimization Algorithm — 2× in this paper
• Benchmark — 1× in this paper · explained in 2 episodes
• Combinatorial Optimization — 1× in this paper · explained in 2 episodes
• Hybrid Approach — 1× in this paper · explained in 4 episodes
• Quantum Annealing (QA) — 1× in this paper · explained in 2 episodes
• Reinforcement Learning — 1× in this paper · explained in 4 episodes
• Resource Constraints — 1× in this paper · explained in 3 episodes

Sources

• Reinforcement Learning for Graph Coloring: Understanding the Power and Limits of Non-Label Invariant Representations
• Rethinking Graph Neural Networks for the Graph Coloring Problem
• A Quantum Approximate Optimization Algorithm
• Symmetric Reduction Techniques for Quantum Graph Colouring

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity