Quantum Booth's array multiplier

Simple item page
dc.creatorAlvarez-Sanchez, J. J.
dc.creatorAlvarez-Bravo, J. V.
dc.creatorNieto, L. M.
dc.date2006-10-31
dc.date.accessioned2026-07-07T07:34:05Z
dc.date.available2026-07-07T07:34:05Z
dc.descriptionA 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.
dc.description6 pages, 8 figures, needs Qcircuit.tex
dc.identifierhttps://arxiv.org/abs/quant-ph/0611007
dc.identifierhttp://arxiv.org/abs/quant-ph/0611007
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/119689
dc.subjectQuantum Physics
dc.titleQuantum Booth's array multiplier
dc.typetext

Files

Collections

arXiv