Implementation and Analysis of Quantum Fourier Transform Gates Over FPGA Framework

Abstract

Since the emergence of the Shor's factoring algorithm, the research over Quantum Fourier Transform (QFT) has motivated the broad attention in the dilemma of the efficient quantum computation. For the purpose of exploring the sizable extent for their exponential growth and the massive computational steps, this paper confers the Field Programmable Gate Arrays (FPGA) implementation of the QFT and, investigate the association between the logic density, complexity and power consumption. In this context, reusability as well as compensating resource utilization is discussed together with the observing issues.