Computer arithmetic structures for quantum cellular automata
Konrad Walus, GRAHAM A. JULLIEN, Vassil S. Dimitrov · 2004
In this paper, we discuss arithmetic structures based on quantum cellular automata (QCA). By taking advantage of the unique capabilities of QCA we are able to design interesting computational architectures. We describe important design considerations and show how addition and multiplication circuits can be implemented using QCADesigner, a QCA design tool which has been developed in our laboratory. QCA technology allows, among other things, the implementation of majority boolean gates and interconnecting "wires" that support cross-overs on the same fabrication level. One of the important challenges with QCA design is working within a different cost function from standard transistor circuits. These differences arise from the device level latching inherent in QCA. This latching makes the total delay of a circuit directly proportional to the maximum number of clocking zones between input and output and the number of gates.