An overview of Quantum Cellular Automata
arXiv:1904.12956
Abstract
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 information at a bounded speed) and translation-invariant (it acts everywhere the same). Quantum cellular automata provide a model/architecture for distributed quantum computation. More generally, they encompass most of discrete-space discrete-time quantum theory. We give an overview of their theory, with particular focus on structure results; computability and universality results; and quantum simulation results.
23 pages, 5 figures. See also review by Farrelly
References in corpus (17)
- Connecting the discrete and continuous-time quantum walks
- Two-dimensional Lattice Gauge Theories with Superconducting Quantum Circuits
- Relationship Between Quantum Walk and Relativistic Quantum Mechanics
- Reversible quantum cellular automata
- Nontrivial Quantum Cellular Automata in Higher Dimensions
- Hamiltonian Quantum Cellular Automata in 1D
- On the structure of Clifford quantum cellular automata
- Clifford Quantum Cellular Automata: Trivial group in 2D and Witt group in 3D
- The Thirring quantum cellular automaton
- Definition and evolution of quantum cellular automata with two qubits per cell
- Simulating Dirac Hamiltonian in Curved Space-time by Split-step Quantum Walk
- Quantum Walks, Weyl equation and the Lorentz group
- Discrete-time quantum walks as fermions of lattice gauge theory
- Insights from Quantum Information into Fundamental Physics
- Initial-state-dependent thermalization in open qubits
- The Block Neighborhood
- The Equivalence of Schrödinger and Heisenberg Pictures in Quantum Cellular Automata