Related papers: On the structure of Clifford quantum cellular auto…
Quantum error-correcting codes are used to protect qubits involved in quantum computation. This process requires logical operators, acting on protected qubits, to be translated into physical operators (circuits) acting on physical quantum…
Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…
Real stabilizer operators, which are also known as real Clifford operators, are generated, through composition and tensor product, by the Hadamard gate, the Pauli Z gate, and the controlled-Z gate. We introduce a normal form for real…
We develop quantum information processing primitives for the planar rotor, the state space of a particle on a circle. By interpreting rotor wavefunctions as periodically identified wavefunctions of a harmonic oscillator, we determine the…
Cellular automata (CA) are discrete-time dynamical systems with local update rules on a lattice. Despite their elementary definition, CA support a wide spectrum of macroscopic phenomena central to statistical physics: equilibrium and…
A discretized time evolution of the wave function for a Dirac particle on a cubic lattice is represented by a very simple quantum cellular automaton. In each evolution step the updated value of the wave function at a given site depends only…
A set of two-parameter bi-orthogonal eigen-spinors has been constructed from a deformed pseudo- Hermitian extension of Pauli Hamiltonian and its Hermitian conjugate. The Hamiltonians thus obtained are iso-spectral to the original Pauli…
Developing space- and time-efficient logical magic state preparation protocols will likely be an essential step towards building a large-scale fault-tolerant quantum computer. Motivated by this need, we introduce a scalable method for…
We propose models of quantum neural networks through Clifford algebras, which are capable of capturing geometric features of systems and to produce entanglement. Due to their representations in terms of Pauli matrices, the Clifford algebras…
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…
We investigate how non-stabilizer resources enable the emergence of quantum state designs within the projected ensemble. Starting from initial states with finite magic and applying resource-free Clifford circuits to scramble them, we…
We construct a novel three-dimensional quantum cellular automaton (QCA) based on a system with short-range entangled bulk and chiral semion boundary topological order. We argue that either the QCA is nontrivial, i.e. not a finite-depth…
This tutorial is about cellular automata that exhibit 'cold dynamics'. By this we mean zero entropy, stabilization of all orbits, trivial asymptotic dynamics, etc. These are purely transient irreversible dynamics, but they capture many…
Quantum computation based on quantum cellular automata (QCA) can greatly reduce the control and precision necessary for experimental implementations of quantum information processing. A QCA system consists of a few species of qubits in…
Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. We present a no-go theorem that places very strong limitations on the potential of such schemes for…
Quantum cellular automata (QCAs) are automorphisms of tensor product algebras that preserve locality, with local quantum circuits as a simple example. We study approximate QCAs, where the locality condition is only satisfied up to a small…
A cellular automaton with $n$ states may be used for construction of reversible second-order cellular automaton with $n^2$ states. Reversible cellular automata with hidden parameters discussed in this paper are generalization of such…
Stabilizer states form an important class of states in quantum information, and are of central importance in quantum error correction. Here, we provide an algorithm for deciding whether one stabilizer (target) state can be obtained from…
Floquet quantum circuits are able to realise a wide range of non-equilibrium quantum states, exhibiting quantum chaos, topological order and localisation. In this work, we investigate the stability of operator localisation and emergence of…
We propose a discrete spacetime formulation of quantum electrodynamics in one-dimension (a.k.a the Schwinger model) in terms of quantum cellular automata, i.e. translationally invariant circuits of local quantum gates. These have exact…