Professional Documents
Culture Documents
AbstractThe fundamental flaws of qubit concept for generalpurpose 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 rulebased, rather than logic-gate based.
Index TermsQuantum Computing, Symbolic Substitutions,
Cellular Automata, Quantum Turing Machine, Aharonov-Bohm
Effect, Quantum Networks.
I. INTRODUCTION
The concept of qubits for quantum computing is well
known for decades now [1]. Yet for general-purpose quantum
computing, this qubit concept has been challenged recently [25]. Any general-purpose quantum computer must be able to
compute anything that is computable. But the computable
things can range from those which are purely sequential in
nature, such as addition operation, to those which are purely
parallel, such as Fourier transform. A true quantum Turing
machine is a massive parallel computing machine that must be
able to handle both extreme computations and anything that are
in between the two extremes. Yet our understanding of
quantum computing rely on those computable things that are
purely parallel, such as Shor algorithm [6], which are specialpurpose computing. Any general-purpose parallel computer
must show how addition operation is implemented first.
The general strategy of parallel computing is to trade space
with time. That means, with millions of processors used, it can
save the number of steps (timewise) needed generally if the
nature of computing is not purely sequential. But the number of
steps required for a purely sequential- nature computing will be
the same for any machine, from a quantum parallel machine
or from a classical electronic machine. There will be no step
advantage (since each machine requires different time to
accomplish one step, there can be no comparison on the
absolute time scale needed). For example, for the addition of
3+5 operation in digital operation, the number of steps (which
is 4 steps) is fixed from any machine because of the ripple
carry requirement. But when four identical processors are
connected together, it can perform higher quality computing in
S1
S4
S2
Fig.1
699
S4
is
S3
700
S2
S4
S1
of
This configuration is to go through four iterations of pulses
and refresh cycles at each cell (labelled as 0,1,2,3 on the
vertical axis on the left side) to arrive at the final configuration
S2 S2 S1S1
V1
cylinders, is
Fig 2
S1 state.
Fig 4.
Fig.3
701
V2
cylinder. It is
worth noting that this is the only set of the transition rules, out
16
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
V. CONCLUSIONS
We show that the use of qubit concepts for general-purpose
computing is fundamentally flawed. Massive parallel
702