Related papers: The Group Structure of Quantum Cellular Automata
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…
We give a new proof of quantifier elimination in the theory of all ordered abelian groups in a suitable language. More precisely, this is only "quantifier elimination relative to ordered sets" in the following sense. Each definable set in…
For any group $G$ and set $A$, a cellular automaton over $G$ and $A$ is a transformation $\tau : A^G \to A^G$ defined via a finite neighborhood $S \subseteq G$ (called a memory set of $\tau$) and a local function $\mu : A^S \to A$. In this…
We introduce and describe a class of simple facilitated quantum spin models in which the dynamics is due to the repeated application of unitary gates. The gates are applied periodically in time, so their combined action constitutes a…
Neutral-atom quantum computing (NAQC) offers distinct advantages such as dynamic qubit reconfigurability, long coherence times, and high gate fidelities, making it a promising platform for scalable quantum computing. Despite these…
The non-associativity of translations in a quantum system with magnetic field background has received renewed interest in association with topologically trivial gerbes over $\mathbb{R}^n.$ The non-associativity is described by a 3-cocycle…
In this paper, we explore relationships between two models of systems which are governed by only the local interactions of large collections of simple components: cellular automata (CA) and the abstract Tile Assembly Model (aTAM). While…
Ultimate bounds on the maximum operating frequency of networks of quantum dot cellular automata devices have yet to be established. We consider the adiabaticity of such networks in the two-state approximation where clocking is achieved via…
In this work, we investigate the computational aspects of asynchronous cellular automata (ACAs), a modification of cellular automata in which cells update independently, following an asynchronous schedule. We introduce flip automata…
We present a construction of integrable hierarchies without or with boundary, starting from a single R-matrix, or equivalently from a ZF algebra. We give explicit expressions for the Hamiltonians and the integrals of motion of the hierarchy…
In this paper, we analyze the algebraic structure of some null boundary as well as some periodic boundary 2-D Cellular Automata (CA) rules by introducing a new matrix multiplication operation using only AND, OR instead of most commonly used…
This note is a survey of examples and results about cellular automata with the purpose of recalling that there is no 'universal' way of being computationally universal. In particular, we show how some cellular automata can embed efficient…
Quantum phases of matter are resources for notions of quantum computation. In this work, we establish a new link between concepts of quantum information theory and condensed matter physics by presenting a unified understanding of…
Quantum cellular automata have been recently considered as a fundamental approach to quantum field theory, resorting to a precise automaton, linear in the field, for the Dirac equation in one dimension. In such linear case a quantum…
We study a quantum cellular automaton (QCA) whose time-evolution is defined from global transition function of classical cellular automata (CA). In order to investigate natural transformations from CA to QCA, the present QCA includes CA…
We introduce a class of quantum adiabatic evolutions that we claim may be interpreted as the equivalents of the unitary gates of the quantum gate model. We argue that these gates form a universal set and may therefore be used as building…
Gauge symmetries play a fundamental role in Physics, as they provide a mathematical justification for the fundamental forces. Usually, one starts from a non-interactive theory which governs `matter', and features a global symmetry. One then…
We study probabilistic cellular automata (PCA) and quantum cellular automata (QCA) as frameworks for solving the Maximum Independent Set (MIS) problem. We first introduce a synchronous PCA whose dynamics drives the system toward the…
We consider in general terms dynamical systems with finite-dimensional, non-simply connected configuration-spaces. The fundamental group is assumed to be finite. We analyze in full detail those ambiguities in the quantization procedure that…
Large scale quantum information processing (QIP) and distributed quantum computation require the ability to perform entangling operations on a large number of qubits. We describe a new photonic module which prepares, deterministically,…