Quantum Booth's array multiplier
arXiv:quant-ph/0611007
Abstract
A new quantum architecture for multiplying signed integers is presented based on Booth's algorithm, which is well known in classical computation. It is shown how a quantum binary chain might be encoded by its flank changes, giving the final product in 2's-complement representation.
6 pages, 8 figures, needs Qcircuit.tex