paper-with-me

Papers

Memcomputing: Leveraging memory and physics to compute efficiently

2018-02-20 · Massimiliano Di Ventra, Fabio L. Traversa

It is well known that physical phenomena may be of great help in computing some difficult problems efficiently. A typical example is prime factorization that may be solved in polynomial time by exploiting quantum entanglement on a quantum computer. There are, however, other types of (non-quantum) physical properties that one may leverage to compute efficiently a wide range of hard problems. In this perspective we discuss how to employ one such property, memory (time non-locality), in a novel physics-based approach to computation: Memcomputing. In particular, we focus on digital memcomputing machines (DMMs) that are scalable. DMMs can be realized with non-linear dynamical systems with memory. The latter property allows the realization of a new type of Boolean logic, one that is self-organizing. Self-organizing logic gates are "terminal-agnostic", namely they do not distinguish between input and output terminals. When appropriately assembled to represent a given combinatorial/optimization problem, the corresponding self-organizing circuit converges to the equilibrium points that express the solutions of the problem at hand. In doing so, DMMs take advantage of the long-range order that develops during the transient dynamics. This collective dynamical behavior, reminiscent of a phase transition, or even the "edge of chaos", is mediated by families of classical trajectories (instantons) that connect critical points of increasing stability in the system's phase space. The topological character of the solution search renders DMMs robust against noise and structural disorder. Since DMMs are non-quantum systems described by ordinary differential equations, not only can they be built in hardware with available technology, they can also be simulated efficiently on modern classical computers. As an example, we will show the polynomial-time solution of the subset-sum problem for the worst...

📄 PDF Abstract BibTeX arXiv:1802.06928

Code (0)

등록된 구현이 없습니다.

Tasks

Combinatorial Optimization

Similar Papers 제목 키워드 기반

Efficient Solution of Boolean Satisfiability Problems with Digital MemComputing

2020-11-12 · S. R. B. Bearden, Y. R. Pei, M. Di Ventra

Boolean satisfiability is a propositional logic problem of interest in multiple fields, e.g., physics, mathematics, and computer science. Beyond a field of research, instances of the SAT problem, as it is known, require …

Numerical Integration

Self-averaging of digital memcomputing machines

2023-01-20 · Daniel Primosch, Yuan-Hang Zhang, Massimiliano Di Ventra

Digital memcomputing machines (DMMs) are a new class of computing machines that employ non-quantum dynamical systems with memory to solve combinatorial optimization problems. Here, we show that the time to solution (TTS)…

Combinatorial Optimization

Memcomputing with membrane memcapacitive systems

2014-10-14 · Yuriy V. Pershin, Fabio L. Traversa, Massimiliano Di Ventra

We show theoretically that networks of membrane memcapacitive systems -- capacitors with memory made out of membrane materials -- can be used to perform a complete set of logic gates in a massively parallel way by simply…

Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states

2014-11-18 · Fabio L. Traversa, Chiara Ramella, Fabrizio Bonani, Massimiliano Di Ventra

Memcomputing is a novel non-Turing paradigm of computation that uses interacting memory cells (memprocessors for short) to store and process information on the same physical platform. It was recently proved mathematicall…

Memcomputing and Swarm Intelligence

2014-08-28 · Y. V. Pershin, M. Di Ventra

We explore the relation between memcomputing, namely computing with and in memory, and swarm intelligence algorithms. In particular, we show that one can design memristive networks to solve short-path optimization proble…

Scheduling