Title

On Addition-Rule Based Cellular Automata

Abstract

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.

Department(s)

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)

1557-5969; 1557-5997

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2014 Old City Publishing, All rights reserved.

Share

 
COinS