Quantum Booth's array multiplier
Quantum Physics
2007-05-23 v1
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.
Cite
@article{arxiv.quant-ph/0611007,
title = {Quantum Booth's array multiplier},
author = {J. J. Alvarez-Sanchez and J. V. Alvarez-Bravo and L. M. Nieto},
journal= {arXiv preprint arXiv:quant-ph/0611007},
year = {2007}
}
Comments
6 pages, 8 figures, needs Qcircuit.tex