Acceleration of digital memcomputing by jumps

Abstract

In this article, we present the potential benefits of incorporating jumps into the dynamics of digital memcomputing machines (DMMs), which have been developed to address complex optimization problems. We illustrate the potential speed improvement of a DMM solver with jumps over an unmodified DMM solver by solving Boolean satisfiability (SAT) problems of different complicatedness. Our findings suggest that jumps can modify scaling exponents and improve solving times by up to 75 %. Interestingly, the advantages of jumps can be seen in cases where the size of the jump is so large that otherwise the continuous dynamics of voltage variables becomes almost binary.

References in corpus (10)

• 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
• 3-Regular 3-XORSAT Planted Solutions Benchmark of Classical and Quantum Heuristic Optimizers
• Efficient Solution of Boolean Satisfiability Problems with Digital MemComputing
• Directed percolation and numerical stability of simulations of digital memcomputing machines
• Hardware implementation of digital memcomputing on small-size FPGAs
• Fully parallel implementation of digital memcomputing on FPGA
• SPICE Modeling of Memcomputing Logic Gates
• Accurate modeling of continuous-time SAT solvers in SPICE