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 qub its is then irrelevant for the addition operation of two bits. The fundamental quantum processor needed is further described here against the quib it 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.