Q-CASA Invited Speaker Performance Evaluations of Noisy Approximate Quantum Fourier Arithmetic with Signed and Unsigned Integers.

The Quantum Fourier Transform (QFT) grants competitive advantages for performing arithmetic operations on quantum computers, and presents a potential route towards a numerical quantum-computational paradigm. Qubit simulation allows us to better gauge what will be possible as the technology improves and identify strategies for early implementations on noisy quantum devices. In this presentation, I will review an implementation of QFT-based unsigned integer addition and multiplication, and present their performance evaluation using noise models based on IBM’s superconducting qubit architecture. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, the number of the arithmetic operands’ superposed integer states, and level of circuit approximation in the QFT. I will then extend the discussion to how this approach may be implemented for signed quantum Fourier arithmetic and offer some preliminary results.