Cellular Structures for Computation in the Quantum Regime

TL;DR

This paper introduces a novel cellular architecture optimized for quantum-scale computation, combining cellular automata and gate arrays to enable efficient algorithms like sublinear search times.

Contribution

It proposes a new hybrid cellular architecture that embeds algorithms spatially for quantum computing, differing from traditional temporal approaches.

Findings

Supports efficient list searching in order cube root of N time

Combines cellular automata with gate arrays for quantum realization

Avoids time-scale issues in classical and quantum regimes

Abstract

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.