qubithubqaoa-maxcut-farhi

Faithful reproduction of the Quantum Approximate Optimization Algorithm (QAOA) for MaxCut, as introduced in the foundational 2014 paper by Farhi, Goldstone, and Gutmann. Demonstrates approximation ratio improvement with increasing circuit depth p on triangle, square, and butterfly graphs (3-5 qubits). Includes automated verification checks against the paper's theoretical bounds.

Run Cite

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

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

4 files · v1

File	Size
README.md	10 KB
circuit.py	19 KB
qubithub.toml	341 B
metadata.json	442 B

Lineage

Not a fork.

No forks yet.

Suggested citation

@software{qubithub_qaoamaxcutfarhi_2026,
  author = {QubitHub Circuits},
  title = {QAOA MaxCut (Farhi 2014)},
  year = {2026},
  version = {v1},
  url = {https://qubithub.co/qubithub/qaoa-maxcut-farhi},
}

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.

Files

Lineage

Suggested citation