Related papers: Three-dimensional quantum cellular automata from c…
We present evidence that operation of QCA (Quantum Cellular Automaton) cells with four dots is possible with an occupancy of 4N+2 electrons per cell (N being an integer). We show that interaction between cells can be described in terms of a…
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…
If L=Z^D and A is a finite set, then A^L is a compact space. A cellular automaton (CA) is a continuous transformation F:A^L--> A^L that commutes with all shift maps. A quasisturmian (QS) subshift is a shift-invariant subset obtained by…
Three-dimensional (3D) gapped topological phases with fractional excitations are divided into two subclasses: one has topological order with point-like and loop-like excitations fully mobile in the 3D space, and the other has fracton order…
Quantum Cellular Automaton (QCA) is a model for universal quantum computation and a natural candidate for digital quantum simulation of relativistic quantum fields. Here we introduce the first photonic platform for implementing…
Goldilocks quantum cellular automata (QCA) have been simulated on quantum hardware and produce emergent small-world correlation networks. In Goldilocks QCA, a single-qubit unitary is applied to each qubit in a one-dimensional chain subject…
We study classical and quantum spin models derived from one-dimensional cellular automata (CA) with nonlinear update rules, focusing on rules 30, 54 and 201. We argue that the classical models, defined such that their ground states…
Recent advances on quantum foundations achieved the derivation of free quantum field theory from general principles, without referring to mechanical notions and relativistic invariance. From the aforementioned principles a quantum cellular…
We investigate the density classification task (DCT) -- determining the majority bit in a one-dimensional binary lattice -- within a quantum cellular automaton (CA) framework. While there is no one-dimensional two-state, radius $r \geq 1$,…
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…
The density classification (DC) task, a computation which maps global density information to local density, is studied using one-dimensional non-unitary quantum cellular automata (QCAs). Two approaches are considered: one that preserves the…
Whether a given target state can be prepared by starting with a simple product state and acting with a finite-depth quantum circuit is a key question in condensed matter physics and quantum information science. It underpins classifications…
Quantum cellular automata (QCA) evolve qubits in a quantum circuit depending only on the states of their neighborhoods and model how rich physical complexity can emerge from a simple set of underlying dynamical rules. For instance,…
Searching for simple models that possess non-trivial controlling properties is one of the central tasks in the field of quantum technologies. In this work, we construct a quantum spin-$1/2$ chain of finite size, termed as controllable spin…
We analytically diagonalize a discrete-time on-site interacting fermionic cellular automaton in the two-particle sector. Important features of the solutions sensibly differ from those of analogous Hamiltonian models. In particular, we found…
We lay down a general framework for how to construct a Topological Quantum Field Theory $Z_A$ defined on shaped triangulations of orientable 3-manifolds from any Pontryagin self-dual locally compact abelian group $A$. The partition function…
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…
The expanding cellular automata (XCA) variant of cellular automata is investigated and characterized from a complexity-theoretical standpoint. An XCA is a one-dimensional cellular automaton which can dynamically create new cells between…
It is known that both quantum and classical cellular automata (CA) exist that are computationally universal in the sense that they can simulate, after appropriate initialization, any quantum or classical computation, respectively. Here we…
Since first introduced by John von Neumann, the notion of cellular automaton has grown into a key concept in computer science, physics and theoretical biology. In its classical setting, a cellular automaton is a transformation of the set of…