  This paper proposes a general quantum algorithm that can be applied to any
classical computer program. Each computational step is written using reversible
operators, but the operators remain classical in that the qubits take on values
of only zero and one. This classical restriction on the quantum states allows
the copying of qubits, a necessary requirement for doing general classical
computation. Parallel processing of the quantum algorithm proceeds because of
the superpositioning of qubits, the only aspect of the algorithm that is
strictly quantum mechanical. Measurement of the system collapses the
superposition, leaving only one state that can be observed. In most instances,
the loss of information as a result of measurement would be unacceptable. But
the linguistically motivated theory of Analogical Modeling (AM) proposes that
the probabilistic nature of language behavior can be accurately modeled in
terms of the simultaneous analysis of all possible contexts (referred to as
supracontexts) providing one selects a single supracontext from those
supracontexts that are homogeneous in behavior (namely, supracontexts that
allow no increase in uncertainty). The amplitude for each homogeneous
supracontext is proportional to its frequency of occurrence, with the result
that the probability of selecting one particular supracontext to predict the
behavior of the system is proportional to the square of its frequency.
