Improved reversible and quantum circuits for Karatsuba-based integer multiplication

Abstract

Integer arithmetic is the underpinning of many quantum algorithms, with applications ranging from Shor's algorithm over HHL for matrix inversion to Hamiltonian simulation algorithms. A basic objective is to keep the required resources to implement arithmetic as low as possible. This applies in particular to the number of qubits required in the implementation as for the foreseeable future this number is expected to be small. We present a reversible circuit for integer multiplication that is inspired by Karatsuba's recursive method. The main improvement over circuits that have been previously reported in the literature is an asymptotic reduction of the amount of space required from $O(n^{1.585})$ to $O(n^{1.427})$. This improvement is obtained in exchange for a small constant increase in the number of operations by a factor less than $2$ and a small asymptotic increase in depth for the parallel version. The asymptotic improvement are obtained from analyzing pebble games on complete ternary trees.

16 pages, 11 figures; to appear in Proceedings of the 12th Conference on Theory of Quantum Computation, Communication and Cryptography (TQC 2017)

Cited by in corpus (5)

• Classically-Verifiable Quantum Advantage from a Computational Bell Test
• Efficient quantum circuit for singular value thresholding
• Quantum Circuits for Toom-Cook Multiplication
• Exhaustive search for optimal molecular geometries using imaginary-time evolution on a quantum computer
• First-quantized eigensolver for ground and excited states of electrons under a uniform magnetic field