Qubits or Symbolic Substitutions for General-Purpose Quantum Computing?
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.
C. Wu, "Qubits or Symbolic Substitutions for General-Purpose Quantum Computing?," Proceedings of the 12th International Conference on Information Technology: New Generations (2015, Las Vegas, NV), pp. 698-702, Institute of Electrical and Electronics Engineers (IEEE), Apr 2015.
The definitive version is available at http://dx.doi.org/10.1109/ITNG.2015.117
12th International Conference on Information Technology: New Generations, ITNG 2015 (2015: Apr. 13-15, Las Vegas, NV)
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)
Article - Conference proceedings
© 2015 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.