Abstract
The application of the quantum Fourier transform (QFT) within the field of quantum computation has been manifold. Shor’s algorithm, phase estimation and computing discrete logarithms are but a few classic examples of its use. These initial blueprints for quantum algorithms have sparked a cascade of tantalizing solutions to problems considered to be intractable on a classical computer. Therefore, two main threads of research have unfolded. First, novel applications and algorithms involving the QFT are continually being developed. Second, improvements in the algorithmic complexity of the QFT are also a sought after commodity. In this work, we review the structure of the QFT and its implementation. In order to put these concepts in their proper perspective, we provide a brief overview of quantum computation. Finally, we provide a permutation structure for putting the QFT within the context of universal computation.
Reference20 articles.
1. Shor, PW.: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM J. Comput., 1997; 26:1484–1509
2. Josza, R.: Quantum Algorithms and the Fourier Transform. Proc. R. Soc. Lond. A, 1998; 454:323–337
3. Nielsen, MA., Chuang, IL.: Quantum Computation and Quantum Information. Cambridge University Press. 2011
4. Barenco, A., Ekert, A., Suominen, KA., Torma, P. : Approximate quantum Fourier transform and decoherence. Phys. Rev. A, 1996; 54
5. Fowler, A., Hollenberg, LCL. : Scalability of Shor’s algorithm with a limited set of rotation gate. Phys. Rev. A, 2004; 70
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Quantum 3D FFT in Tomography;Applied Sciences;2023-03-21