On Addition-Rule Based Cellular Automata
We argue that for a general-purpose quantum computing, the addition rules must be imposed and implemented first. The consequence of this condition brings the addition operation into the architecture of one-dimensional cellular automaton with a dual-bit in each cell. They are then transformed into a 16 specific right-nearest neighbor interaction rules for each cell. Thus addition-rule based general-purpose quantum computing can only be found in one set out of roughly 4.3 billion available sets in the cellular automata. Some addition-rule incompatible examples are also presented and compared.
C. Wu, "On Addition-Rule Based Cellular Automata," Journal of Cellular Automata, vol. 9, no. 4, Old City Publishing, Jan 2014.
Electrical and Computer Engineering
Keywords and Phrases
Cellular automata; Quantum computers; Turing machines; Aharonov-bohm effects; Dual bit; Nearest-neighbor interactions; Quantum Computing; Rule based; Symbolic substitution; Mobile security
International Standard Serial Number (ISSN)
Article - Journal
© 2014 Old City Publishing, All rights reserved.
01 Jan 2014