Intrinsically Universal One-dimensional Quantum Cellular Automata in Two Flavours
作者： Pablo Arrighi , Renan Fargetton , Zizhu Wang
DOI: 10.3233/FI-2009-0041
关键词:
摘要: We give a one-dimensional quantum cellular automaton (QCA) capable of simulating all others. By this we mean that the initial configuration and local transition rule any onedimensional QCA can be encoded within universal QCA. Several steps will then correspond to one step simulated The simulation preserves topology in sense each cell is as group adjacent cells encoding linear hence does not carry cost computation. do two flavours: weak which requires an infinite but periodic strong needs only finite configuration.
archives-ouvertes.fr
arxiv-vanity.com参考文章(27)
Karel Culík, Jürgen Albert, A Simple Universal Cellular Automaton and its One-Way and Totalistic Version. Complex Systems. ,vol. 1, ,(1987)
Nicolas Ollinger, UNIVERSALITIES IN CELLULAR AUTOMATA A (SHORT) SURVEY JAC 2008. pp. 102- 118 ,(2008)
Nicolas Ollinger, Automates cellulaires : structures Ecole normale supérieure de lyon - ENS LYON. ,(2002)
Jarkko Kari, On the circuit depth of structurally reversible cellular automata Fundamenta Informaticae. ,vol. 38, pp. 93- 107 ,(1999) , 10.3233/FI-1999-381208
Norman Margolus, Tommaso Toffoli, Cellular Automata Machines: A New Environment for Modeling ,(1987)
David A. Meyer, UNITARITY IN ONE DIMENSIONAL NONLINEAR QUANTUM CELLULAR AUTOMATA arXiv: Quantum Physics. ,(1996)
Vwani Roychowdhury, Farrokh Vatan, Tal Mor, Matthew Pulver, P. Oscar Boykin, On Universal and Fault-Tolerant Quantum Computing arXiv: Quantum Physics. ,(1999)
M. Delorme, An Introduction to Cellular Automata Springer Netherlands. pp. 5- 49 ,(1999) , 10.1007/978-94-015-9153-9_1
R F Werner, B Schumacher, Reversible quantum cellular automata arXiv: Quantum Physics. ,(2004)
Isaac L. Chuang, Michael A. Nielsen, Quantum Computation and Quantum Information ,(2000)