A quantum multiply-accumulator

Full text not archived in this repository.

Please see our End User Agreement.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

Maynard, C. M. and Pius, E. (2014) A quantum multiply-accumulator. Quantum Information Processing, 13 (5). pp. 1127-1138. ISSN 1573-1332 doi: 10.1007/s11128-013-0715-5

Abstract/Summary

This paper proposes a quantum multiply-accumulator circuit (QMAC), which can perform the calculation on conventional integers faster than its classical counterpart. Whereas classically applying a multiply–adder (MAC) n times to k bit integers would require O(n log k) parallel steps, the hybrid QMAC needs only O(n+k) steps for the exact result and O(n+log k) steps for an approximate result. The proposed circuit could potentially be embedded in a conventional computer architecture as a quantum device or accelerator, enabling a wide range of applications to execute faster.

Altmetric Badge

Item Type Article
URI https://reading-clone.eprints-hosting.org/id/eprint/78132
Identification Number/DOI 10.1007/s11128-013-0715-5
Refereed Yes
Divisions No Reading authors. Back catalogue items
Publisher Springer
Download/View statistics View download statistics for this item

University Staff: Request a correction | Centaur Editors: Update this record

Search Google Scholar