Efficient encoding of the weighted MAX k-CUT on a quantum computer using QAOA

Franz Georg Fuchs, Herman Øie Kolden, Niels Henrik Aase +1

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. Th…