A Possible Nanometer-scale Computing Device Based on an Adding Cellular Automaton

Abstract

We present a simple one-dimensional Cellular Automaton (CA) which has the property that an initial state composed of two binary numbers evolves quickly into a final state which is their sum. We call this CA the Adding Cellular Automaton (ACA). The ACA requires only 2N two-state cells in order to add any two N-1 bit binary numbers. The ACA could be directly realized as a wireless nanometer-scale computing device - a possible implementation using coupled quantum dots is outlined.

8 pages, RevTex, 3 Postscript figures. This version to appear in App. Phys. Lett

References in corpus (1)

• Single-Electron Parametron: Reversible Computation in a Discrete State System

Cited by in corpus (8)

• Quantum Computing with NMR
• A Survey of Cellular Automata: Types, Dynamics, Non-uniformity and Applications
• Energy levels of a parabolically confined quantum dot in the presence of spin-orbit interaction
• Optimal combinations of imperfect objects
• Quantum mechanics of lattice gas automata. II. Boundary conditions and other inhomogeneities
• Quantum entanglement in the neighborhood of pseudo-transition for a spin-1/2 Ising-XYZ diamond chain
• Parity Problem With A Cellular Automaton Solution
• Cellular Structures for Computation in the Quantum Regime