Quantum arithmetic circuits have attracted extensive attention recently since it plays fundamental roles in many applications of quantum computing. Specifically, quantum circuits for integer multiplication are of great significance to various quantum algorithms, including Shor’s integer factorization and discrete logarithm algorithm. In this article, we design a family of quantum circuits for integer multiplication based on the famous classical integer multiplication algorithm, Schönhage–Strassen algorithm. We have made slight modifications to the algorithm to simplify its quantum circuit implementation. As a result, the quantum circuit we designed has gate depth

$O(\log ^{2} n)$

. To the best of our knowledge, this is the first poly-logarithmic depth quantum circuit for integer multiplication which keeps the circuit size and the number of ancillary qubits subquadratic. Our design has size

$O(n\log n\log \log n)$

counted by elementary quantum gates which is the same as the time complexity of the Schönhage–Strassen algorithm, and it consumes

$O(n\log n\log \log n)$

clean ancillary qubits. In addition, we also utilize a weaker version of Schönhage–Strassen algorithm to give a family of circuits which has depth at the same order

$O(\log ^{2} n)$

but with significantly smaller constants, while still keeping the size and number of ancillary qubits subquadratic.

	Year	Citations

About