QubitHub

qubithubgraph-coloring

Solves Graph 2-Coloring using the Quantum Approximate Optimization Algorithm (QAOA). Assigns one of two colors to each vertex to minimize edge conflicts (adjacent vertices sharing a color). Default: 4-vertex graph with triangle subgraph (chromatic number 3, minimum 1 conflict). Identical circuit structure to MaxCut — coloring minimizes conflicts while MaxCut maximizes cuts.

RunCite

No licence specified, so all rights are reserved by default — forking copies this circuit but grants you no rights to reuse it.

Framework
Qiskit
Qubits
4
Depth
8
Gate set
H, RZZ, RX
Licence
Not specified
Version
v1
Updated
3 days ago
Last run
3 months ago

Circuit

circuit.py · Qiskit · depth 8
Loading circuit diagram…

4 files · v1

Files

FileSize
README.md9.0 KB
circuit.py20 KB
qubithub.toml351 B
metadata.json452 B

Lineage

Not a fork.

No forks yet.

Suggested citation

@software{qubithub_graphcoloring_2026,
  author = {QubitHub Circuits},
  title = {QAOA for Graph Coloring},
  year = {2026},
  version = {v1},
  url = {https://qubithub.co/qubithub/graph-coloring},
}

Generated from this circuit's metadata. QubitHub does not mint DOIs, so this is not a registered identifier — check it against your venue's requirements before publishing.