Related papers: Logical Gates via Gliders Collisions
We present a formal and constructive framework for simulating Alternating Finite Automata (AFAs) using Logic-Gated Time-Shared Feedforward Networks (LG-TS-FFNs). Unlike prior neural automata models limited to Nondeterministic Finite…
Using error correcting codes and fault tolerant techniques, it is possible, at least in theory, to produce logical qubits with significantly lower error rates than the underlying physical qubits. Suppose, however, that the gates that act on…
Classical cellular automata represent a class of explicit discrete spacetime lattice models in which complex large-scale phenomena emerge from simple deterministic rules. With the goal to uncover different physically distinct classes of…
We construct single input logic gates using the energy sharing collisions of a minimal number of (three) bright optical solitons associated with the three soliton solution of the integrable Manakov system. As computation requires state…
Cellular automata (CA) are a class of computational models that exhibit rich dynamics emerging from the local interaction of cells arranged in a regular lattice. In this work we focus on a generalised version of typical CA, called graph…
Biological neural networks are capable of recruiting different sets of neurons to encode different memories. However, when training artificial neural networks on a set of tasks, typically, no mechanism is employed for selectively producing…
In quantum logic operations, information is carried by the wavefunction rather than the energy distribution. Therefore, the relative phase is essential. Abelian and non-Abelian phases can be emulated in classical waves using passive coupled…
Multi-valued logic gates, which can handle quaternary numbers as inputs, are developed by exploiting the ballistic transport properties of quantum point contacts in series. The principle of a logic gate that finds the minimum of two…
This paper proposes the use of Eukaryotic cells, namely astrocytes, to develop logic gates. The logic gates are achieved by manipulating the threshold of Ca$^{2+}$ ion flows between the cells, based on the input signals. Through wet-lab…
Nanomechanical computers promise robust, low energy information processing. However, to date, electronics have generally been required to interconnect gates, while no scalable, purely nanomechanical approach to computing has been achieved.…
Actin is a globular protein which forms long polar filaments in eukaryotic. The actin filaments play roles of cytoskeleton, motility units , information processing and learning. We model actin filament as a double chain of finite state…
The state of structural balance (termed also `Heider balance') of a social network is often discussed in social psychology and sociophysics. In this state, actors at network nodes classify other individuals as enemies or friends. Hence, the…
Cellular automata have been useful artificial models for exploring how relatively simple rules combined with spatial memory can give rise to complex emergent patterns. Moreover, studying the dynamics of how rules emerge under artificial…
The three-qubit conditional swap gate(Fredkin gate) is a universal gate that can be used to create any logic circuit and has many direct usages. In this paper, we experimentally realized Fredkin gate with only three transition pulses in…
A cellular automaton is a deterministic and exactly computable dynamical system which mimics certain fundamental aspects of physical dynamics such as spatial locality and finite entropy. CA systems can be constructed which have additional…
Bijections between sets may be seen as discrete (or crisp) unitary transformations used in quantum computations. So discrete quantum cellular automata are cellular automata with reversible transition functions. This note studies on 1d…
We propose a new way of implementing several elementary quantum gates for qubits in the coherent state basis. The operations are probabilistic and employ single photon subtractions as the driving force. Our schemes for single-qubit phase…
This is a study of the one-dimensional elementary cellular automaton rule 54 in the new formalism of "flexible time". We derive algebraic expressions for groups of several cells and their evolution in time. With them we can describe the…
A natural architecture for nanoscale quantum computation is that of a quantum cellular automaton. Motivated by this observation, in this paper we begin an investigation of exactly unitary cellular automata. After proving that there can be…
The Fredkin three-bit gate is universal for computational logic, and is reversible. Classically, it is impossible to do universal computation using reversible two-bit gates only. Here we construct the Fredkin gate using a combination of six…