Maximum Cut

Maximum Cut is a benchmark problem in combinatorial optimization that involves partitioning a graph into two subsets to maximize the number of edges between them, and it is used to evaluate algorithms in the context of quantum architecture search and circuit design.

Papers using Maximum Cut (2)

Separating Ansatz Discovery from Deployment on Larger Problems: Reinforcement Learning for Modular Circuit Design2025Reinforcement Learning for Variational Quantum Circuits Design2024 · 1 cites