Max-K-Cut

The 'Max-k-Cut' benchmark contains graphs used to evaluate the performance of quantum algorithms, specifically the Quantum Approximate Optimization Algorithm (QAOA), in solving integer optimization problems related to partitioning the graph into \(k\) subsets while maximizing the number of edges between different subse

Papers using Max-K-Cut (2)

Encoding Matters: Benchmarking Binary and D-ary Representations for Quantum Combinatorial Optimization2026Solving non-native combinatorial optimization problems using hybrid quantum-classical algorithms2024