On the solvable-unsolvable transition due to noise-induced chaos in digital memcomputing
arXiv:2506.14928 · doi:10.1063/5.0288274
Abstract
Digital memcomputing machines (DMMs) have been designed to solve complex combinatorial optimization problems. Since DMMs are fundamentally classical dynamical systems, their ordinary differential equations (ODEs) can be efficiently simulated on modern computers. This provides a unique platform to study their performance under various conditions. An aspect that has received little attention so far is how their performance is affected by the numerical errors in the solution of their ODEs and the physical noise they would be naturally subject to if built in hardware. Here, we analyze these two aspects in detail by varying the integration time step (numerical noise) and adding stochastic perturbations (physical noise) into the equations of DMMs. We are particularly interested in understanding how noise induces a chaotic transition that marks the shift from successful problem-solving to failure in these systems. Our study includes an analysis of power spectra and Lyapunov exponents depending on the noise strength. The results reveal a correlation between the instance solvability and the sign of the ensemble averaged mean largest Lyapunov exponent. Interestingly, we find a regime in which DMMs with positive mean largest Lyapunov exponents still exhibit solvability. Furthermore, the power spectra provide additional information about our system by distinguishing between regular behavior (peaks) and chaotic behavior (broadband spectrum). Therefore, power spectra could be utilized to control whether a DMM operates in the optimal dynamical regime. Overall, we find that the qualitative effects of numerical and physical noise are mostly similar, despite their fundamentally different origin.
References in corpus (13)
- Predictability in the large: an extension of the concept of Lyapunov exponent
- Optimization hardness as transient chaos in an analog approach to constraint satisfaction
- Hiding solutions in random satisfiability problems: A statistical mechanics approach
- Polynomial-time solution of prime factorization and NP-hard problems with digital memcomputing machines
- Topological field theory and computing with instantons
- Efficient Solution of Boolean Satisfiability Problems with Digital MemComputing
- Chaos in high-dimensional dynamical systems
- Instantons in self-organizing logic gates
- Digital Memcomputing: from Logic to Dynamics to Topology
- Directed percolation and numerical stability of simulations of digital memcomputing machines
- Chaos or Order?
- Deconstructing noise and its universal crossover to non- behavior
- Accurate modeling of continuous-time SAT solvers in SPICE