Integer Arithmetic With Hybrid Quantum-Classical Circuits

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) $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.

References in corpus (7)

• Measurement-based quantum computation with cluster states
• Quantum Networks for Elementary Arithmetic Operations
• A new quantum ripple-carry addition circuit
• Addition on a Quantum Computer
• Quantum interference and manipulation of entanglement in silicon wire waveguide quantum circuits
• Novel Reversible TSG Gate and Its Application for Designing Components of Primitive Reversible/Quantum ALU
• Circuit Design for A Measurement-Based Quantum Carry-Lookahead Adder

Cited by in corpus (1)

• Efficient quantum circuits for dense and non-unitary operators