Directed percolation and numerical stability of simulations of digital memcomputing machines

Digital memcomputing machines (DMMs) are a novel, non-Turing class of machines designed to solve combinatorial optimization problems. They can be physically realized with continuous-time, non-quantum dynamical systems with memory (time non-locality), whose ordinary differential equations (ODEs) can...

Full description

Saved in:
Bibliographic Details
Published in:Chaos (Woodbury, N.Y.) N.Y.), 2021-06, Vol.31 (6), p.063127-063127
Main Authors: Zhang, Yuan-Hang, Di Ventra, Massimiliano
Format: Article
Language:English
Subjects:
Combinatorial analysis
Differential equations
Numerical stability
Optimization
Ordinary differential equations
Percolation
Robustness (mathematics)
Runge-Kutta method
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Digital memcomputing machines (DMMs) are a novel, non-Turing class of machines designed to solve combinatorial optimization problems. They can be physically realized with continuous-time, non-quantum dynamical systems with memory (time non-locality), whose ordinary differential equations (ODEs) can be numerically integrated on modern computers. Solutions of many hard problems have been reported by numerically integrating the ODEs of DMMs, showing substantial advantages over state-of-the-art solvers. To investigate the reasons behind the robustness and effectiveness of this method, we employ three explicit integration schemes (forward Euler, trapezoid, and Runge–Kutta fourth order) with a constant time step to solve 3-SAT instances with planted solutions. We show that (i) even if most of the trajectories in the phase space are destroyed by numerical noise, the solution can still be achieved; (ii) the forward Euler method, although having the largest numerical error, solves the instances in the least amount of function evaluations; and (iii) when increasing the integration time step, the system undergoes a “solvable–unsolvable transition” at a critical threshold, which needs to decay at most as a power law with the problem size, to control the numerical errors. To explain these results, we model the dynamical behavior of DMMs as directed percolation of the state trajectory in the phase space in the presence of noise. This viewpoint clarifies the reasons behind their numerical robustness and provides an analytical understanding of the solvable–unsolvable transition. These results land further support to the usefulness of DMMs in the solution of hard combinatorial optimization problems.
ISSN:1054-1500
1089-7682
DOI:10.1063/5.0045375