Partitioned quantum cellular automata are intrinsically universal

DOI10.1007/s11047-011-9277-6zbMath1251.68147arXiv1010.2335WikidataQ62037055 ScholiaQ62037055MaRDI QIDQ1761701

Jonathan Grattage, Pablo Arrighi

Publication date: 15 November 2012

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.2335

zbMATH Keywords

cellular automata; quantum computing; intrinsic universality

Mathematics Subject Classification ID

81P68: Quantum computation

68Q80: Cellular automata (computational aspects)

Related Items

Intrinsically universal \(n\)-dimensional quantum cellular automata, Quantum walks via quantum cellular automata, An Intrinsically Universal Family of Causal Graph Dynamics, Universality in Infinite Petri Nets, Block Representation of Reversible Causal Graph Dynamics, Discrete Lorentz covariance for quantum walks and quantum cellular automata

Cites Work

• Unitarity plus causality implies localizability
• Reversible simulation of one-dimensional irreversible cellular automata
• A six-state minimal time solution to the Firing squad synchronization problem
• Computation and construction universality of reversible cellular automata
• One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations
• A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton
• Intrinsically Universal One-dimensional Quantum Cellular Automata in Two Flavours
• Mathematical Foundations of Computer Science 2004
• Endomorphisms and automorphisms of the shift dynamical system
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item