QubitHub

qubithubmaxcut

Solves the Maximum Cut problem using the Quantum Approximate Optimization Algorithm (QAOA). Partitions graph vertices into two sets to maximize edges between them. Default: 4-node cycle graph with optimal cut of 4. QAOA p=1 achieves ~75% approximation ratio with theoretical guarantee of 69.2%.

RunCite
Framework
Qiskit
Qubits
4
Depth
6
Gate set
H, RZZ, RX
Licence
Apache-2.0
Version
v1
Updated
1 day ago
Runs
None completed

Circuit

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

4 files · v1

Files

FileSize
metadata.json425 B
qubithub.toml324 B
circuit.py16 KB
README.md7.7 KB

Lineage

Not a fork.

No forks yet.

Suggested citation

@software{qubithub_maxcut_2026,
  author = {QubitHub Circuits},
  title = {QAOA for MaxCut},
  year = {2026},
  version = {v1},
  url = {https://qubithub.co/qubithub/maxcut},
}

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.