Benchmark

Weighted Max-Cut Benchmark

QAOA / Quantum Walk Optimisation Algorithm (QWOA) · Optimization · 31 qubits · Qiskit, Cirq

Extended Max-Cut benchmark using weighted graph instances, which present a harder optimization landscape than the standard unweighted variant. Weighted instances introduce a proliferation of poor local optima and exacerbate barren-plateau issues. Recent work compares QAOA with non-variational quantum walk algorithms on weighted instances up to 31 nodes.

Max-Cutweighted-graphsQAOAcombinatorial-optimizationQWOA

Extended Max-Cut benchmark using weighted graph instances, which present a harder optimization landscape than the standard unweighted variant. Weighted instances introduce a proliferation of poor local optima and exacerbate barren-plateau issues. Recent work compares QAOA with non-variational quantum walk algorithms on weighted instances up to 31 nodes.

Key Metrics
Max graph size
31 nodes
Methods compared
QAOA vs QWOA (quantum walk)
Why It Matters

Demonstrates that weighted instances are substantially harder than unweighted MaxCut, with barren plateaus and local optima proliferating in the optimization landscape.

Hardware

Simulator / hardware-agnostic

Framework

Qiskit, Cirq