Quantum Modeler · Fixed-K Graph Coloring

Fixed-K Graph Coloring

Find a proper coloring for a supplied color count. Every vertex gets one color and connected vertices must differ. This checks fixed-K feasibility; it does not find the chromatic number.

Execute at most 8 total qubits using an ideal classical statevector simulator. Symbolic scaling does not execute or solve a larger instance.

Build your problem

The starter path has a valid 2-coloring, such as colors 0, 1, 0. Its exact penalty minimum is 0.

Problem inputsZero-based vertices. Empty edges are allowed; no self-loops or duplicate undirected edges.
Execution settings

Depth 1 QAOA, at most 64 parameter evaluations. One completed build uses one run when usage limits are enabled.

Qubit budget

All decision and auxiliary variables count toward the limit. The API validates all constraints before reserving a run.

Read the mathematical methodology

Ready to validate a small instance.

Planned model families

TSP · Job Scheduling · Vehicle Routing remain roadmap items, not executable solvers.

No quantum advantage, real-QPU performance, physical-qubit requirement, or production-scale solution quality is claimed.