I. Introduction
Complex computing problems can be solved efficiently by quantum computing (QC) in comparison with classical computing [1]. Quantum computers are able to efficiently solve problems such as unorganized data searching [2], number factoring [3], counting solution problem [4], hidden subgroup problem [5], and security of cryptographic systems [6]. Moreover, quantum computers can perform operations in polynomial time compared to classical computers. However, the most critical issue with the QC is its physical realization. At present, the physical realization of QC is possible with the help of a classical computer and up to some extent by a quantum computer. However, the technologies for the physical realization of the quantum computer are not developed enough to deal with complex computing applications; therefore, most of the QC-based problems are solved on classical computers. To get rid of these obstacles, researchers are actively involved in the implementation of large scale QC. QC developed rapidly when [7] through his algorithm showed that QC-based integer number factoring could be performed in polynomial time. The integral component of the Shor’s algorithm is quantum Fourier transform (QFT). From the computing point of view, QFT is one of the most imperative computational problems and finds its application in discrete algorithms [3], phase estimation [8], interchange of position and momentum states [8], quantum key distribution protocol [9], multiparty quantum telecommunication [10], and quantum arithmetic [11].