Title

Qubits or Symbolic Substitutions for General-Purpose Quantum Computing?

Abstract

The fundamental flaws of qubit concept for general-purpose quantum computing are elaborated here. We show that from implementing of the addition operation of two bits, only four symbolic substitution rules are needed. Superposition of four states from the two qubits is then irrelevant for the addition operation of two bits. The fundamental quantum processor needed is further described here against the quibit concept. The quantum Turing Machine is thus settled in the cellular automata architecture. Therefore, quantum computing must be rule-based, rather than logic-gate based.

Meeting Name

12th International Conference on Information Technology: New Generations, ITNG 2015 (2015: Apr. 13-15, Las Vegas, NV)

Department(s)

Electrical and Computer Engineering

Keywords and Phrases

Cellular automata; Computation theory; Machinery; Mobile security; Quantum optics; Turing machines, Aharonov-bohm effects; Quantum Computing; Quantum network; Quantum turing machine; Symbolic substitution, Quantum computers

International Standard Book Number (ISBN)

978-1-4799-8828-0

Document Type

Article - Conference proceedings

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2015 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.

Share

 
COinS