Quantum Booth's array multiplier
classification
🪐 quant-ph
keywords
quantumboothalgorithmarchitecturearraybinarychainchanges
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.