A quantum cellular automaton (QCA) is a unitary discrete-time evolution of a quantum many-body system, which can be described as a dynamics system , where A is any matrix and is a unitary operator representing the global evolution of QCA. And QCAs are characterized by locality (or causality). Among them, quantum circuits are the special classes of QCAs, which use unitary operators to control and transform the initial quantum state of qubit into a final quantum state, quantum circuits are special and widely studied in quantum information. A group is a set of elements combined with an operation, which satisfies associativity, identity and invertibility. This article shows that group theory provides the right language for studying the relation between QCAs and quantum circuits among them.
A quantum cellular automaton (QCA) is a unitary discrete-time evolution of a quantum many-body system, which can be described as a dynamics system , where A is any matrix and is a unitary operator representing the global evolution of QCA. And QCAs are characterized by locality (or causality). Among them, quantum circuits are the special classes of QCAs, which use unitary operators to control and transform the initial quantum state of qubit into a final quantum state, quantum circuits are special and widely studied in quantum information. A group is a set of elements combined with an operation, which satisfies associativity, identity and invertibility. This article shows that group theory provides the right language for studying the relation between QCAs and quantum circuits among them.
Quantum cellular automata (QCA) are models of quantum computation of particular interest from the point of view of quantum simulation. Quantum lattice gas automata (QLGA - equivalently partitioned quantum cellular automata) represent an interesting subclass of QCA. QLGA have been more deeply analyzed than QCA, whereas general QCA are likely to capture a wider range of quantum behavior. Discriminating between QLGA and QCA is therefore an important question. In spite of much prior work, classifying which QCA are QLGA has remained an open problem. In the present paper we establish necessary and sufficient conditions for unbounded, finite QCA (finitely many active cells in a quiescent background) to be QLGA. We define a local condition that classifies those QCA that are QLGA, and we show that there are QCA that are not QLGA. We use a number of tools from functional analysis of separable Hilbert spaces and representation theory of associative algebras that enable us to treat QCA on finite but unbounded configurations in full detail.
Over an arbitrary commutative ring R, we develop a theory of quantum cellular automata. We then use algebraic K-theory to construct a space Q(X) of quantum cellular automata (QCA) on a given metric space X. In most cases of interest, π0Q(X) classifies QCA up to quantum circuits and stabilization. Notably, the QCA spaces are related by homotopy equivalences Q(∗)≃ΩnQ(Zn) for all n, which shows that the classification of QCA on Euclidean lattices is given by an Ω-spectrum indexed by the dimension n. As a corollary, we also obtain a non-connective delooping of the K-theory of Azumaya R-algebras, which may be of independent interest. We also include a section leading to the Ω-spectrum for QCA over C∗-algebras with unitary circuits.
The information flow in a quantum system is a fundamental feature of its dynamics. An important class of dynamics are quantum cellular automata (QCA), systems with discrete updates invariant in time and space, for which an index theory has been proposed for the quantification of the net flow of quantum information across a boundary. While the index is rigid in the sense of begin invariant under finite-depth local circuits, it is not defined when the system is coupled to an environment, i.e.for non-unitary time evolution of open quantum systems. We propose a new measure of information flow for non-unitary QCA denoted the information current which is not rigid, but can be computed locally based on the matrix-product operator representation of the map.
The quantum walk is a subset of classical random walks.Considerable research has lately been conducted on quantum walks in relation to quantum computing.The walk may be thought of as a type of quantum cellular automata.In a broader sense, there is a one-to-one link between them.Furthermore, we look at another type of quantum cellular automata that may be thought of as a quantum version of stochastic cellular automata.The quantum walk formalism is a widely used and quite practical paradigm for modelling quantum systems such as Dirac equation simulations, discrete dynamics in both the low and high energy regimes, and the development of a multitude of quantum algorithms.The walker in a QW moves in a quantum superposition of pathways, and the ensuing interference serves as the foundation for a broad range of quantum algorithms, including quantum search, graph isomorphism issues, and rating nodes in a network.To generate a block representation of n-dimensional quantum cellular automata, we apply the following general result to them.As a result, we have demonstrated that their generic, axiomatic formulation nevertheless produces a unifying, operational representation of them.Some non-trivial ramifications are investigated, such as the fact that bijective non-reversible CA are not physical as closed systems, or that quantum information can move faster than classical informationwithin some specified dynamics.Finally, we present n-dimensional quantum cellular automata that can simulate anything else.This means that the initial configuration and local transition rule of any one-dimensional QCA may be stored within the universal QCA's initial configuration.The simulated QCA will then correspond to many phases of the universal QCA.In the sense that each cell in the simulated QCA is represented as a group of nearby cells in the universal QCA, the simulation preserves the topology.Because the encoding is linear, it bears no cost of the calculation.
As quantum devices scale to larger and larger sizes, a significant challenge emerges in scaling their coherent controls accordingly. Quantum cellular automata (QCAs) constitute a promising framework that bypasses this control problem: universal dynamics can be achieved using only a static qubit array and global control operations. Despite an extensive history of theoretical explorations and proposals, QCAs have not been experimentally explored in the context of highly-scalable globally-controlled systems. Here we realize QCAs on a dual-species Rydberg array of rubidium and cesium atoms, leveraging independent global control of each species to perform multiple quantum protocols. Seeding an automaton with different initial states, we explore many-body dynamics of quasiparticles and grow GHZ states across both species, highlighting the flexibility of our approach. We further develop a second automaton using a novel mediated entangling gate, enabling generation of 96.7(1.7)%-fidelity Bell states, 17-qubit cluster states, and high-connectivity graph states. Our results demonstrate that simple global controls enable access to a rich variety of applications through the QCA framework. The versatility and scalability of QCAs present compelling opportunities for the development of quantum information systems, as well as new perspectives on quantum many-body dynamics.