The Computational Abilities of Random Magnetic Structures

Keywords:
QCA, magnetic QCA, random structures, placement errors

Abstract:
In this paper, we investigate the computational abilities of random magnetic structures. Magnetic Quantum-dot Cellular Automata have the following advantages. They are simpler to fabricate and inputs are easier to control during computations. However, we believe magnetic QCA are sensitive to placement errors. Placing magnetic quantum dots using random structures will alleviate the problem of dot placement. The goal of our work is to simulate magnetic QCA using random structures and to compare and contrast their behavior with electronic random structures. We model such a system with tiny bar magnets. Simulations are being performed to find the lowest energy (ground state of the system). At the ground state, the polarity designated for the output magnets should encode the result of the computation. We will compare and contrast the computational abilities of random magnetic structures with their electronic counterpart. We believe that the arrangement of magnetic quantum dots using random magnetic structures will be easier to construct and the magnetic versions of QCA are promising candidates for low-power computing devices

Back to Program

Nanotech 2005 Conference Program Abstract