相关论文: On Quantum Cellular Automata

Take a cellular automaton, consider that each configuration is a basis vector in some vector space, and linearize the global evolution function. If lucky, the r esult could actually make sense physically, as a valid quantum evolution; but…

Stephen Wolfram proclaimed in his 2003 seminal work "A New Kind Of Science" that simple recursive programs in the form of Cellular Automata (CA) are a promising approach to replace currently used mathematical formalizations, e.g.…

We show techniques of analyzing complex dynamics of cellular automata (CA) with chaotic behaviour. CA are well known computational substrates for studying emergent collective behaviour, complexity, randomness and interaction between order…

Cellular Automata(CA) is a discrete computing model which provides simple, flexible and efficient platform for simulating complicated systems and performing complex computation based on the neighborhoods information. CA consists of two…

Cellular automata are a fundamental computational model with applications in mathematics, computer science, and physics. In this work, we explore the study of cellular automata to cases where the universe is a group, introducing the concept…

Cellular automata, CA for short are continuous maps defined on the set of configurations over a finite alphabet A that commutes with the shift. They are characterized by the existence of local function which determine by local behavior the…

This article is an attempt to generalize the classical theory of reversible computing, principally developed by Bennet [IBM J. Res. Develop., 17(1973)] and by Fredkin and Toffoli [Internat. J. Theoret. Phys., 21(1982)], to the quantum case.…

The Thirring Quantum Cellular Automaton (QCA) describes the discrete time dynamics of local fermionic modes that evolve according to one step of the Dirac cellular automaton followed by the most general on-site number-preserving…

Describing complex phenomena by means of cellular automata (CA) has shown to be a very effective approach in pure and applied sciences. In fact, the number of published papers concerning this topic has tremendously increased over the last…

We show how the trajectories of $d$-dimensional cellular automata (CA) can be used to determine the ground states of $(d+1)$-dimensional classical spin models, and we characterise their quantum phase transition, when in the presence of a…

Quantum Random Walks (QRW) were first defined as one-particle sectors of Quantum Lattice Gas Automata (QLGA). Recently, they have been generalized to include history dependence, either on previous coin (internal, i.e., spin or velocity)…

Classical Cellular Automata (CCAs) are a powerful computational framework widely used to model complex systems driven by local interactions. Their simplicity lies in the use of a finite set of states and a uniform local rule, yet this…

The cellular automata (CA) approach to traffic modeling is extended to allow for spatially homogeneous steady state solutions that cover a two dimensional region in the flow-density plane. Hence these models fulfill a basic postulate of a…

The complex Hilbert space of standard quantum mechanics may be treated as a real Hilbert space. The pure states of the complex theory become mixed states in the real formulation. It is then possible to generalize standard quantum mechanics,…

The formalism of classical and quantum mechanics on phase space leads to symplectic and Heisenberg group representations, respectively. The Wigner functions give a representation of the quantum system using classical variables. The…

The question of whether quantum real-time one-counter automata (rtQ1CAs) can outperform their probabilistic counterparts has been open for more than a decade. We provide an affirmative answer to this question, by demonstrating a…

Probabilistic cellular automata with deterministic updating are quantum systems. We employ the quantum formalism for an investigation of random probabilistic cellular automata, which start with a probability distribution over initial…

We provide an introduction to Quantum Cellular Automata.

In the near future the era of Beyond CMOS will start as the scaling of the current CMOS technology will reach the fundamental limit. QCA (Quantum-dot Cellular Automata) is the transistor less computation paradigm and viable candidate for…

We consider quantum cellular automata on a body-centred cubic lattice and provide a simple derivation of the only two homogenous, local, isotropic, and unitary two-dimensional automata [G. M. D'Ariano and P. Perinotti, Physical Review A 90,…