Related papers: Logical Gates via Gliders Collisions
In the fields of computation and neuroscience, much is still unknown about the underlying computations that enable key cognitive functions including learning, memory, abstraction and behavior. This paper proposes a mathematical and…
In this work we propose a ratchet effect which provides a general means of performing clocked logic operations on discrete particles, such as single electrons or vortices. The states are propagated through the device by the use of an…
Probabilistic cellular automata describe the dynamics of classical spin models, which, for sufficiently small temperature $T$, can serve as classical memory capable of storing information even in the presence of nonzero external magnetic…
We propose an architecture based on Quantum cellular Automata which allows the use of only one type of quantum gates per computational step in order to perform nearest neighbor interactions. The model is built in partial steps, each one of…
We propose and discuss two variants of kinetic particle models - cellular automata in 1+1 dimensions, which have some appeal due to their simplicity and intriguing properties which could warrant further research and applications. The first…
Implementation of quantum logic gates with linear optical elements plays a prominent role in quantum computing due to the relatively easier manipulation and realization. We present efficient schemes to implement controlled-NOT (CNOT) gate…
A novel, information-based classification of elementary cellular automata is proposed that circumvents the problems associated with isolating whether complexity is in fact intrinsic to a dynamical rule, or if it arises merely as a product…
We present a one dimensional reversible block cellular automaton, where the time evolution is dictated by a period 3 cycle of update rules. At each time step a subset of the cells is updated using a four site rule with two control bits and…
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both…
We consider temporal logic verification of (possibly nonlinear) dynamical systems evolving over continuous state spaces. Our approach combines automata-based verification and the use of so-called barrier certificates. Automata-based…
Reversible logic can provide lower switching energy costs relative to all irreversible logic, including those developed by industry in semiconductor circuits, however, more research is needed to understand what is possible. Superconducting…
Nonlinear optimal control problems for trajectory planning with obstacle avoidance present several challenges. While general-purpose optimizers and dynamic programming methods struggle when adopted separately, their combination enabled by a…
Quantum error correction and fault-tolerant quantum computation are two fundamental concepts which make quantum computing feasible. While providing a theoretical means with which to ensure the arbitrary accuracy of any quantum circuit,…
In this paper a cellular automata model for one-lane traffic flow is presented. A new set of rules is proposed to better capture driver reactions to traffic that are intended to preserve safety on the highway. As a result, drivers behavior…
We construct a family of infinitely many new candidate non-Abelian self-correcting topological quantum memories in $D\geq 5+1$ spacetime dimensions without particle excitations using local commuting non-Pauli stabilizer lattice models and…
Neurons are individually translated into simple gates to plan a brain based on human psychology and intelligence. State machines, assumed previously learned in subconscious associative memory are shown to enable equation solving and…
We realize autonomous Boolean networks by using logic gates in their autonomous mode-of-operation on a field-programmable gate array. This allows us to implement time-continuous systems with complex dynamical behaviors that can be…
In this article, we study some parallel processing algorithms for multiplication and modulo operations. We demonstrate that the state transitions that are formed under these algorithms satisfy lattice-linearity, where these algorithms…
We introduce a new class of probabilistic cellular automata that are capable of exhibiting rich dynamics such as synchronization and ergodicity and can be easily inferred from data. The system is a finite-state locally interacting Markov…
The Fredkin chain is a spin-$1/2$ model with interaction of three nearest neighbors. In the case of periodic boundary conditions, the ground state is degenerate and can be described in terms of equivalence classes of Dyck paths. We…