Related papers: Quantum Cellular Automaton Model for the Generaliz…
In this talk we review some recent results from random matrix models as applied to some non-perturbative issues in QCD. All of the issues we will discuss touched upon the important phenomenon related to the spontaneous breaking of chiral…
Several proposed schemes for the physical realization of a quantum computer consist of qubits arranged in a cellular array. In the quantum circuit model of quantum computation, an often complex series of two-qubit gate operations is…
Quantum Information and the new informational paradigm are entering the domain of quantum field theory and gravity, suggesting the quantum automata framework. The quantum automaton is the minimal-assumption extension to the Planck and…
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…
Quantum cellular automata are alternative quantum-computing paradigms to quantum Turing machines and quantum circuits. Their working mechanisms are inherently automated, therefore measurement free, and they act in a translation invariant…
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…
We study lattice spin systems and analyze the evolution of Gaussian concentration bounds (GCB) under the action of probabilistic cellular automata (PCA), which serve as discrete-time analogues of Markovian spin-flip dynamics. We establish…
Cellular Automata are discrete-time dynamical systems on a spatially extended discrete space which provide paradigmatic examples of nonlinear phenomena. Their stochastic generalizations, i.e., Probabilistic Cellular Automata (PCA), are…
We propose a new way of understanding how chiral symmetry is realized in the high temperature phase of QCD. Based on the finding that a simple free instanton gas precisely describes the details of the lowest part of the spectrum of the…
We investigate one-dimensional elementary probabilistic cellular automata (PCA) whose dynamics in first-order mean-field approximation yields discrete logisticlike growth models for a single-species unstructured population with…
We study the Anderson-type transition previously found in the spectrum of the QCD quark Dirac operator in the high temperature, quark-gluon plasma phase. Using finite size scaling for the unfolded level spacing distribution, we show that in…
Studies of quantum computer implementations suggest cellular quantum computer architectures. These architectures can simulate the evolution of quantum cellular automata, which can possibly simulate both quantum and classical physical…
Quantum-dot Cellular Automata (QCA) may offer a viable alternative of traditional transistor-based technology at the nanoscale. When modeling a QCA circuit, the number of degrees of freedom necessary to describe the quantum mechanical state…
We consider Clifford Quantum Cellular Automata (CQCAs) and their time evolution. CQCAs are an especially simple type of Quantum Cellular Automata, yet they show complex asymptotics and can even be a basic ingredient for universal quantum…
In this paper we present a systematic view of Quantum Cellular Automata (QCA), a mathematical formalism of quantum computation. First we give a general mathematical framework with which to study QCA models. Then we present four different…
A method of quantization of classical soliton cellular automata (QSCA) is put forward that provides a description of their time evolution operator by means of quantum circuits that involve quantum gates from which the associated Hamiltonian…
Gravitational clustering of a random distribution of point masses is dominated by the effective short-range interactions due to large-scale isotropy. We introduce a one-dimensional cellular automaton to reproduce this effect in the most…
We investigate a connection between a property of the distribution and a conserved quantity for the reversible cellular automaton derived from a discrete-time quantum walk in one dimension. As a corollary, we give a detailed information of…
We discuss the role of classical control in the context of reversible quantum cellular automata. Employing the structure theorem for quantum cellular automata, we give a general construction scheme to turn an arbitrary cellular automaton…
Dirac particle dynamics is encoded as a unitary path summation rule and implemented on a qubit array, where the qubit array represents both spacetime and the fermions contained therein. The unitary path summation rule gives a quantum…