相关论文: A universally programmable Quantum Cellular Automa…
Certain fermionic quantum field theories are equivalent to probabilistic cellular automata, with fermionic occupation numbers associated to bits. We construct an automaton that represents a discrete model of spinor gravity in four…
We introduce a novel method of quantum emulation of a classical reversible cellular automaton. By applying this method to a chaotic cellular automaton, the obtained quantum many-body system thermalizes while all the energy eigenstates and…
We investigate quantum cellular automata (QCA) on one-dimensional spin systems defined over a subalgebra of the full local operator algebra - the symmetric subalgebra under a finite Abelian group symmetry $G$. For systems where each site…
One can think of some physical evolutions as being the emergent-effective result of a microscopic discrete model. Inspired by classical coarse-graining procedures, we provide a simple procedure to coarse-grain color-blind quantum cellular…
We propose a physical realization of quantum cellular automata (QCA) using arrays of ultracold atoms excited to Rydberg states. The key ingredient is the use of programmable multifrequency couplings which generalize the Rydberg blockade and…
Quantum computations usually take place under the control of the classical world. We introduce a Classically-controlled Quantum Turing Machine (CQTM) which is a Turing Machine (TM) with a quantum tape for acting on quantum data, and a…
We have previously proposed a way of using coupled quantum dots to construct digital computing elements - quantum-dot cellular automata (QCA). Here we consider a different approach to using coupled quantum-dot cells in an architecture…
This investigation studies the ergodic properties of reversible linear cellular automata over $\mathbb{Z}_m$ for $m \in \mathbb{N}$. We show that a reversible linear cellular automaton is either a Bernoulli automorphism or non-ergodic. This…
We have investigated the behavior of bistable cells made up of four quantum dots and occupied by two electrons, in the presence of realistic confinement potentials produced by depletion gates on top of a GaAs/AlGaAs heterostructure. Such a…
In this paper we study the space evolution in the Rule 54 reversible cellular automaton, which is a paradigmatic example of a deterministic interacting lattice gas. We show that the spatial translation of time configurations of the…
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…
Lattice geometry profoundly shapes physical phenomena such as subsystem symmetry and directed percolation (DP). Among various lattice geometries, hyperbolic lattices are characterized by constant negative curvature and non-Abelian…
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,…
This paper presents a classification of Cellular Automata rules based on its properties at the nth iteration. Elaborate computer program has been designed to get the nth iteration for arbitrary 1-D or 2-D CA rules. Studies indicate that the…
Quantum-dot Cellular Automata (QCA) is one of the most important computing technologies for the future and will be the alternative candidate for current CMOS technology. QCA is attracting a lot of researchers due to many features such as…
We study reversible quantum cellular automata with the restriction that these are also Clifford operations. This means that tensor products of Pauli operators (or discrete Weyl operators) are mapped to tensor products of Pauli operators.…
Random access memory is an indispensable device for classical information technology. Analog to this, for quantum information technology, it is desirable to have a random access quantum memory with many memory cells and programmable access…
We use the theory of $\textbf{U}_q$-tilting modules to construct cellular bases for centralizer algebras. Our methods are quite general and work for any quantum group $\textbf{U}_q$ attached to a Cartan matrix and include the non-semisimple…
This paper studies three classes of cellular automata from a computational point of view: freezing cellular automata where the state of a cell can only decrease according to some order on states, cellular automata where each cell only makes…
Number-conserving (or {\em conservative}) cellular automata have been used in several contexts, in particular traffic models, where it is natural to think about them as systems of interacting particles. In this article we consider several…