Giorgio Sartor

Efficient Encoding of the Weighted MAX $$k$$-CUT on a Quantum Computer Using QAOA

2021 · SN Computer Science

Abstract The weighted MAX $$k$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math> -CUT problem consists of finding a k -partition of a given weighted undirected graph G ( V , E ), such that the sum of the weights of …

The capacitated MAX k-CUT on a Quantum Computer

2020 · arXiv (Cornell University)

The weighted MAX k-CUT problem consists of finding a k-partition of a given weighted undirected graph G(V,E) such that the sum of the weights of the crossing edges is maximized. The problem is of particular …