Related papers: Fluxonic Cellular Automata
In previous works, hexagonal cellular automata (CA) have been studied as a variation of the famous Game of Life CA, mainly for spiral phenomena simulations; where the most interesting constructions are related to the Belousov-Zhabotinsky…
This paper introduces a new formalism for quantum cellular automata (QCAs), based on evolving tensor products of qubits using local unitary operators. It subsequently uses this formalism to analyze and validate several conjectures, stemming…
We investigate the evolution of quantum information under Pauli measurement circuits. We focus on the case of one- and two-dimensional systems, which are relevant to the recently introduced Floquet topological codes. We define local…
Quantum cellular automata consist in arrays of identical finite-dimensional quantum systems, evolving in discrete-time steps by iterating a unitary operator G. Moreover the global evolution G is required to be causal (it propagates…
We introduce an efficient cellular automaton for the coagulation-fission process with diffusion 2A->3A, 2A->A in arbitrary dimensions. As the well-known Domany-Kinzel model, it is defined on a tilted hypercubic lattice and evolves by…
Since the first demonstration of coherent control of a quantum state of a superconducting charge qubit a variety of Josephson-junction-based qubits have been implemented with remarkable progress in coherence time and read-out schemes.…
We propose a concept of magnetic logic circuits engineering, which takes an advantage of magnetization as a computational state variable and exploits spin waves for information transmission. The circuits consist of magneto-electric cells…
How do cellular automata behave in the limit of a very large number of cells? Is there a continuum limit with simple properties? We attack this problem by mapping certain classes of automata to quantum field theories for which powerful…
Cellular automata are interacting classical bits that display diverse emergent behaviors, from fractals to random-number generators to Turing-complete computation. We discover that quantum cellular automata (QCA) can exhibit complexity in…
Quantum computation based on quantum cellular automata (QCA) can greatly reduce the control and precision necessary for experimental implementations of quantum information processing. A QCA system consists of a few species of qubits in…
Layered Cellular Automata (LCA) extends the concept of traditional cellular automata (CA) to model complex systems and phenomena. In LCA, each cell's next state is determined by the interaction of two layers of computation, allowing for…
In this work, we investigate the computational aspects of asynchronous cellular automata (ACAs), a modification of cellular automata in which cells update independently, following an asynchronous schedule. We introduce flip automata…
Distributed automata are finite-state machines that operate on finite directed graphs. Acting as synchronous distributed algorithms, they use their input graph as a network in which identical processors communicate for a possibly infinite…
We present ongoing work on a tool that consists of two parts: (i) A raw micro-level abstract world simulator with an interface to (ii) a 3D game engine, translator of raw abstract simulator data to photorealistic graphics. Part (i)…
Quantum-dot cellular automata (QCA) is a likely candidate for future low power nano-scale electronic devices. Sequential circuits in QCA attract more attention due to its numerous application in digital industry. On the other hand,…
Three cellular automaton (CA) models of increasing complexity are introduced to model driven diffusive systems related to the generalized Frenkel-Kontorova (FK) models recently proposed by Braun [Phys.Rev.E58, 1311 (1998)]. The models are…
The original local, discrete example of Linear Unitary Cellular Automata (LUCA) is analyzed in terms of a new representation previously introduced in [1] for classical CA. Several important underlying symmetries are reviewed and their tight…
Cellular automata (CA) are discrete-time dynamical systems with local update rules on a lattice. Despite their elementary definition, CA support a wide spectrum of macroscopic phenomena central to statistical physics: equilibrium and…
Cellular automata are a class of computational models based on simple rules and algorithms that can simulate a wide range of complex phenomena. However, when using conventional computers, these 'simple' rules are only encapsulated at the…
In this paper we introduce a new quantum computation model, the linear quantum cellular automaton. Well-formedness is an essential property for any quantum computing device since it enables us to define the probability of a configuration in…