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

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…

qubithub.toml · 324 B

Code

Loading qubithub.toml…

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.