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

      Fuchs, Franz Georg; Kolden, Herman Øie; Aase, Niels Henrik; Sartor, Giorgio (Peer reviewed; Journal article, 2021)
      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 interest as ...