  We present a new cellular data processing scheme, a hybrid of existing
cellular automata (CA) and gate array architectures, which is optimized for
realization at the quantum scale. For conventional computing, the CA-like
external clocking avoids the time-scale problems associated with ground-state
relaxation schemes. For quantum computing, the architecture constitutes a novel
paradigm whereby the algorithm is embedded in spatial, as opposed to temporal,
structure. The architecture can be exploited to produce highly efficient
algorithms: for example, a list of length N can be searched in time of order
cube root N.
