Eliminating Non-Logical States from Linear Quantum-Dot-Cellular Automata

Document Type


Publication Date





Quantum-dot-cellular automata are a method of computing with small numbers of electrons. The static shape of a particular automaton corresponds to a problem to be solved while the time-dependent evolution of the distribution of electrons within the automaton corresponds to a computation to solve the problem. The final distribution of electrons within the automaton represents a solution. The robustness of an automaton is characterized as the absolute energy difference between the lowest energy state and the first excited state. For computing IDENTITY, a basis for translating values across a larger system, it is shown that the robustness of the automaton can be improved dramatically by redesigning to eliminate non-logical states. By such redesign, the states that populate the energy levels between the logically correct answer and logically incorrect answers are prohibited, thereby increasing the energy gap between the ground state and the first excited state.