Benchmark

QAOA MaxCut Optimization

Quantum Approximate Optimization Algorithm (QAOA) · Optimization · 12 qubits · PennyLane, Cirq

Benchmark of the Quantum Approximate Optimization Algorithm for solving the MaxCut problem on random graphs. Tests the quality of approximate solutions as a function of circuit depth (p-levels) and graph size. A standard benchmark for hybrid quantum-classical optimization.

QAOAoptimizationMaxCuthybridcombinatorial

Benchmark of the Quantum Approximate Optimization Algorithm for solving the MaxCut problem on random graphs. Tests the quality of approximate solutions as a function of circuit depth (p-levels) and graph size. A standard benchmark for hybrid quantum-classical optimization.

Key Metrics
Problem type
MaxCut on random graphs
Qubits tested
12
Why It Matters

The canonical benchmark for hybrid quantum-classical optimization, testing how QAOA approximation quality scales with circuit depth and graph complexity.

Hardware

Simulator / hardware-agnostic

Framework

PennyLane, Cirq

Sources
📄
🌐