← all papers · overview

Quantum Booth's Array Multiplier

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.

Related papers

Ranked by semantic similarity — how closely each paper's abstract matches this one (100% = near-identical topic).