Parallel framework for accelerating combinatorial optimization

Abstract

A method for solving a combinatorial optimization problem includes receiving a spin network corresponding to the combinatorial optimization problem. The method further includes generating a plurality of replicas of the spin network. The method includes minimizing an energy of each replica of the plurality of replicas in parallel. The method includes resampling the plurality of replicas using a plurality of reweighting factors, wherein each reweighting factor of the plurality of reweighting factors corresponds to the energy of the replica. The method includes aggregating solutions produced by each replica of the plurality of replicas. The method further includes generating configurations based on the aggregated solutions.

Dependencies are inferred from the claim text.