Solving the ternary QCA logic gate problem by means of adiabatic switching

This paper demonstrates that with the introduction of adiabatic switching one can successfully solve the ternary quantum-dot cellular automata (QCA) problem of the basic geometry that implements the AND and OR logic functions. It is shown that in that case the geometry can perform both the binary majority logic function as well as ternary AND and OR logic functions.