Related papers: Probabilistic cellular automaton for quantum parti…
This essay is an attempted to address, from a modern perspective, the motion of a particle. Quantum mechanically, motion consists of a series of localizations due to repeated interactions that, taken close to the limit of the continuum,…
Stochastic processes govern the time evolution of a huge variety of realistic systems throughout the sciences. A minimal description of noisy many-particle systems within a Markovian picture and with a notion of spatial dimension is given…
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…
A new paradigm for the unification of physics is described. It is called Cellular Automata (CA) theory, which is the most massively parallel computer model currently known to science. We maintain that at the tiniest distance and time scales…
We study the dynamics of a particle in continuous time and space, the displacement of which is governed by an internal degree of freedom (spin). In one definite limit, the so-called quantum random walk is recovered but, although quite…
A universal map is derived for all deterministic 1D cellular automata (CA) containing no freely adjustable parameters. The map can be extended to an arbitrary number of dimensions and topologies and its invariances allow to classify all CA…
Present quantum theory, which is statistical in nature, does not predict joint probability distribution of position and momentum because they are noncommuting. We propose a deterministic quantum theory which predicts a joint probability…
Classical transport equations with probabilistic initial conditions can be viewed as quantum systems. In a discrete version they are probabilistic automata. The time-local probabilistic information is encoded in a classical wave function.…
Particle-like objects are observed to propagate and interact in many spatially extended dynamical systems. For one of the simplest classes of such systems, one-dimensional cellular automata, we establish a rigorous upper bound on the number…
We propose an iterative algorithm to investigate the cooperative evolution dominated by information encoded within state spaces in a random quantum cellular automaton. Inspired by the 2-gram model in statistical linguistics, the updates of…
We summarize a recent study of discrete (integer-valued) Hamiltonian cellular automata (CA) showing that their dynamics can only be consistently defined, if it is linear in the same sense as unitary evolution described by the Schr\"odinger…
The Bohmian formulation of quantum mechanics is used in order to describe the measurement process in an intuitive way without a reduction postulate in the framework of a deterministic single system theory. Thereby the motion of the hidden…
In this thesis we will work under the premises of the Cellular Automata Interpretation of QM, by Gerard 't Hooft, according to whom particles evolve following the rules of Cellular Automata (CA), a mathematical model consisting of discrete…
We propose a probabilistic cellular automata model for the spread of innovations, rumors, news, etc. in a social system. The local rule used in the model is outertotalistic, and the range of interaction can vary. When the range R of the…
This paper presents a simple model that mimics quantum mechanics (QM) results in terms of probability fields of free particles subject to self-interference, without using Schr\"{o}dinger equation or wavefunctions. Unlike the standard QM…
Probability is an important question in the ontological interpretation of quantum mechanics. It has been discussed in some trajectory interpretations such as Bohmian mechanics and stochastic mechanics. New questions arise when the…
Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quantum machine: it has to be unitary, that is its time evolution…
In this paper we create a model of particle motion on a three-dimensional lattice using discrete random walk with small steps. We rigorously construct a probability space of the particle trajectories. Unlike deterministic approach in…
In this paper, we propose a novel probabilistic control framework for efficiently controlling an ensemble of quantum systems that can also compensate for the interaction of the systems with the external environment. The main challenge in…
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…