The frustrated-loop algorithm in its original form was proposed to generate spin-glass problems with known solutions to test the performance of the D-Wave quantum annealer [1]}. Although the algorithm was initially proposed to be implemented on a 3D square lattice, it can be easily generalized to any graph as long as it is not acyclic [2]}. For the purpose of this paper, we focus on the case of a complete weighted bipartite graph [2]}, which, as shown in Section REF , is general enough to represent a weighted MAX-2-SAT problem with any underlying graph structure.
