Browsing SINTEF Digital by Subject "Quantum algorithms"
Now showing items 1-2 of 2
-
Constraint Preserving Mixers for the Quantum Approximate Optimization Algorithm
(Peer reviewed; Journal article, 2022)The quantum approximate optimization algorithm/quantum alternating operator ansatz (QAOA) is a heuristic to find approximate solutions of combinatorial optimization problems. Most of the literature is limited to quadratic ... -
Efficient Encoding of the Weighted MAX k-CUT on a Quantum Computer Using QAOA
(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 ...