Integer Arithmetic With Hybrid Quantum-Classical Circuits

preprint2013arXivOpen access

Abstract

Quantum circuits which perform integer arithmetic could potentially outperform their classical counterparts. In this paper, a quantum circuit is considered which performs a specific computational pattern on classically represented integers to accelerate the computation. Such a hybrid circuit could be embedded in a conventional computer architecture as a quantum device or accelerator. In particular, a quantum multiply-add circuit (QMAC) using a Quantum Fourier Transform (QFT) is proposed which can perform the calculation on conventional integers faster than its conventional counterpart. Whereas classically applying a multiply-adder (MAC) nn times to kk bit integers would require O(nlog⁡k)O(n \log k) parallel steps, the hybrid QMAC needs only O(n+k)O(n + k) steps for the exact result and O(n+log⁡k)O(n + \log k) steps for an approximate result.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.