Intrinsically universal \(n\)-dimensional quantum cellular automata
From MaRDI portal
Publication:1757844
DOI10.1016/j.jcss.2011.12.008zbMath1250.68203arXiv0907.3827WikidataQ62037054 ScholiaQ62037054MaRDI QIDQ1757844
Pablo Arrighi, Jonathan Grattage
Publication date: 6 November 2012
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0907.3827
68Q80: Cellular automata (computational aspects)
68Q12: Quantum algorithms and complexity in the theory of computing
Related Items
Symmetries of the Dirac quantum walk and emergence of the de Sitter group, A novel design of 8-bit adder/subtractor by quantum-dot cellular automata, The Simulation Powers and Limitations of Hierarchical Self-Assembly Systems
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
- From quantum cellular automata to quantum lattice gases
- Partitioned quantum cellular automata are intrinsically universal
- From Dirac to diffusion: decoherence in quantum lattice gases
- 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
- Intrinsic universality of a 1-dimensional reversible Cellular Automaton
- Reversible cellular automaton able to simulate any other reversible one using partitioning automata
- Mathematical Foundations of Computer Science 2004
- Endomorphisms and automorphisms of the shift dynamical system
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
