Weighted Max-Cut Benchmark
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.[1]
- Algorithm: QAOA / Quantum Walk Optimisation Algorithm (QWOA)
- Category: optimization
- Qubits: 31
- Framework: Qiskit, Cirq
- Reproducible: Yes
- Published:
- Max-Cut
- weighted-graphs
- QAOA
- combinatorial-optimization
- QWOA
What algorithm does Weighted Max-Cut Benchmark use?
Weighted Max-Cut Benchmark uses the QAOA / Quantum Walk Optimisation Algorithm (QWOA) algorithm, categorized under optimization.
Frequently Asked Questions
What is the Weighted Max-Cut Benchmark benchmark?
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.
Is Weighted Max-Cut Benchmark reproducible?
Yes, this benchmark is reproducible.