Complex matter field universal models with optimal scaling for solving combinatorial optimization problems

01/18/2022
by   Natalia G. Berloff, et al.
0

We develop a universal model based on the classical complex matter fields that allow the optimal mapping of many real-life NP-hard combinatorial optimisation problems into the problem of minimising a spin Hamiltonian. We explicitly formulate one-to-one mapping for three famous problems: graph colouring, the travelling salesman, and the modular N-queens problem. We show that such a formulation allows for several orders of magnitude improvement in the search for the global minimum compared to the standard Ising formulation. At the same time, the amplitude dynamics escape from the local minima.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/17/2018

Solving Minimum k-supplier in Adleman-Lipton model

In this paper, we consider an algorithm for solving the minimum k suppli...
research
03/15/2018

Securely Solving the Distributed Graph Coloring Problem

Combinatorial optimization is a fundamental problem found in many fields...
research
08/24/2012

A Unifying Survey of Reinforced, Sensitive and Stigmergic Agent-Based Approaches for E-GTSP

The Generalized Traveling Salesman Problem (GTSP) is one of the NP-hard ...
research
05/18/2023

Neural Algorithmic Reasoning for Combinatorial Optimisation

Solving NP-hard/complete combinatorial problems with neural networks is ...
research
10/30/2020

POMO: Policy Optimization with Multiple Optima for Reinforcement Learning

In neural combinatorial optimization (CO), reinforcement learning (RL) c...
research
06/27/2014

An interacting replica approach applied to the traveling salesman problem

We present a physics inspired heuristic method for solving combinatorial...

Please sign up or login with your details

Forgot password? Click here to reset