arXiv subjects

Fabio L. Traversa

Publications and source records attributed to Fabio L. Traversa.

24 records · Page 2Linked to original sources

arXiv2015

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

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 mathematically that memcomputing machines have the same computational power of non-deterministic Turing machines. Therefore, they can solve NP-complete problems in polynomial time and, using the appropriate architecture, with resources that only grow polynomially with the input size. The reason for this computational power stems from properties inspired by the brain and shared by any universal memcomputing machine, in particular intrinsic parallelism and information overhead, namely the capability of compressing information in the collective state of the memprocessor network. Here, we show an experimental demonstration of an actual memcomputing architecture that solves the NP-complete version of the subset-sum problem in only one step and is composed of a number of memprocessors that scales linearly with the size of the problem. We have fabricated this architecture using standard microelectronic technology so that it can be easily realized in any laboratory setting. Even though the particular machine presented here is eventually limited by noise--and will thus require error-correcting codes to scale to an arbitrary number of memprocessors--it represents the first proof-of-concept of a machine capable of working with the collective state of interacting memory cells, unlike the present-day single-state machines built using the von Neumann architecture.

cs.ET↗

arXiv2014

Universal Memcomputing Machines

We introduce the notion of universal memcomputing machines (UMMs): a class of brain-inspired general-purpose computing machines based on systems with memory, whereby processing and storing of information occur on the same physical location. We analytically prove that the memory properties of UMMs endow them with universal computing power - they are Turing-complete -, intrinsic parallelism, functional polymorphism, and information overhead, namely their collective states can support exponential data compression directly in memory. We also demonstrate that a UMM has the same computational power as a non-deterministic Turing machine, namely it can solve NP--complete problems in polynomial time. However, by virtue of its information overhead, a UMM needs only an amount of memory cells (memprocessors) that grows polynomially with the problem size. As an example we provide the polynomial-time solution of the subset-sum problem and a simple hardware implementation of the same. Even though these results do not prove the statement NP=P within the Turing paradigm, the practical realization of these UMMs would represent a paradigm shift from present von Neumann architectures bringing us closer to brain-like neural computation.

cs.NE↗

arXiv2014

Noise in oscillators: a review of state space decomposition approaches

We review the state space decomposition techniques for the assessment of the noise properties of autonomous oscillators, a topic of great practical and theoretical importance for many applications in many different fields, from electronics, to optics, to biology. After presenting a rigorous definition of phase, given in terms of the autonomous system isochrons, we provide a generalized projection technique that allows to decompose the oscillator fluctuations in terms of phase and amplitude noise, pointing out that the very definition of phase (and orbital) deviations depends of the base chosen to define the aforementioned projection. After reviewing the most advanced theories for phase noise, based on the use of the Floquet basis and of the reduction of the projected model by neglecting the orbital fluctuations, we discuss the intricacies of the phase reduction process pointing out the presence of possible variations of the noisy oscillator frequency due to amplitude-related effects.

physics.data-an↗

arXiv2014

Absorption and Injection Models for Open Time-Dependent Quantum Systems

In the time-dependent simulation of pure states dealing with transport in open quantum systems, the initial state is located outside of the active region of interest. Using the superposition principle and the analytical knowledge of the free time-evolution of such state outside the active region, together with absorbing layers and remapping, a model for a very significant reduction of the computational burden associated to the numerical simulation of open time-dependent quantum systems is presented. The model is specially suited to study (many-particle and high-frequency effects) quantum transport, but it can also be applied to any other research field where the initial time-dependent pure state is located outside of the active region. From numerical simulations of open quantum systems described by the (effective mass) Schrödinger and (atomistic) tight-binding equations, a reduction of the computational burden of about two orders of magnitude for each spatial dimension of the domain with a negligible error is presented.

quant-ph↗

arXiv2013

Application of Floquet theory to dynamical systems with memory

We extend the recently developed generalized Floquet theory [Phys. Rev. Lett. 110, 170602 (2013)] to systems with infinite memory. In particular, we show that a lower asymptotic bound exists for the Floquet exponents associated to such cases. As examples, we analyze the cases of an ideal 1D system, a Brownian particle, and a circuit resonator with an ideal transmission line. All these examples show the usefulness of this new approach to the study of dynamical systems with memory, which are ubiquitous in science and technology.

math-ph↗

arXiv2013

Generalized Floquet theory: application to dynamical systems with memory and Bloch's theorem for nonlocal potentials

Floquet theory is a powerful tool in the analysis of many physical phenomena, and extended to spatial coordinates provides the basis for Bloch's theorem. However, in its original formulation it is limited to linear systems with periodic coefficients. Here, we extend the theory by proving a theorem for the general class of systems including linear operators commuting with the period-shift operator. The present theorem greatly expands the range of applicability of Floquet theory to a multitude of phenomena that were previously inaccessible with this type of analysis, such as dynamical systems with memory. As an important extension, we also prove Bloch's theorem for nonlocal potentials.

math.DS↗