Scalable quantum circuit design for QFT-based arithmetic

TL;DR

This paper introduces a scalable quantum Fourier transform-based arithmetic circuit compatible with qubits and qudits, demonstrating improved efficiency and reduced gate count, especially with ququarts, for quantum addition and subtraction of multiple integers.

Contribution

It presents a novel scalable QFT-based arithmetic circuit for multi-input operations using qubits and qudits, highlighting advantages of ququarts in efficiency and circuit simplicity.

Findings

Ququart-based systems reduce gate count significantly.

The proposed circuits improve computational efficiency.

Ququarts decrease noise sensitivity and circuit complexity.

Abstract

In this research, we create a scalable version of the quantum Fourier transform-based arithmetic circuit to perform addition and subtraction operations on N n-bit unsigned integers encoded in quantum registers, and it is compatible with d-level quantum sources, called qudits. We present qubit- and ququart-based multi-input QFT adders, and we compare and discuss potential benefits such as circuit simplicity and noise sensitivity. The results show that a ququart-based system significantly reduces gate count and improves computational efficiency compared to qubit-based systems. Overall, the findings presented in this study represent a promising step forward in the development of efficient quantum arithmetic circuits, particularly for multi-input operations, with clear advantages for ququart-based systems in reducing gate count, decoherence, and circuit complexity.