A six-state minimal time solution to the firing squad synchronization problem
Theoretical Computer Science
Reversible simulation of one-dimensional irreversible cellular automata
Theoretical Computer Science
On the circuit depth of structurally reversible cellular automata
Fundamenta Informaticae - Special issue dedicated to A. Salomaa
Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata
LATIN '95 Proceedings of the Second Latin American Symposium on Theoretical Informatics
Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Inducing an Order on Cellular Automata by a Grouping Operation
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations
Language and Automata Theory and Applications
Universality in cellular automata
SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
Intrinsically Universal One-dimensional Quantum Cellular Automata in Two Flavours
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Unitarity plus causality implies localizability
Journal of Computer and System Sciences
A simple n-dimensional intrinsically universal quantum cellular automaton
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Intrinsically universal n-dimensional quantum cellular automata
Journal of Computer and System Sciences
Hi-index | 0.00 |
There have been several non-axiomatic approaches taken to define quantum cellular automata (QCA). Partitioned QCA (PQCA) are the most canonical of these non-axiomatic definitions. In this work we show that any QCA can be put into the form of a PQCA. Our construction reconciles all the non-axiomatic definitions of QCA, showing that they can all simulate one another, and hence that they are all equivalent to the axiomatic definition. This is achieved by defining generalised n-dimensional intrinsic simulation, which brings the computer science based concepts of simulation and universality closer to theoretical physics. The result is not only an important simplification of the QCA model, it also plays a key role in the identification of a minimal n-dimensional intrinsically universal QCA.