The Quantum Fourier Transform
DOI:
https://doi.org/10.47185/27113760.v2n2.62Keywords:
Qubit, Quantum gate, Tensor product, SuperpositionAbstract
The Quantum Fourier Transform (TCF) is the generalization of the classical Fourier transform in which concepts from quantum mechanics are used. Two algorithms and their quantum circuits are presented to calculate TCF. With it you can factor a whole number into its prime factors.
Downloads
References
Benjumea, D. (2018). Elementos y conceptos de computación cuántica. Recuperado el agosto de 2021, de http://bibing.us.es/proyectos/abrepro y/91926/fichero/TFG-1926-BENJUMEA.pdf
Garcia, J. (2016). Computación Cuántica. Universidad Politecnica de Madrid, Madrid. Recuperado el Junio de 2020, de https://docplayer.es/88529958-Computacion-cuanttca-jesus-garcia- lopez-de-lacalle-francisco-garcia-mazario.html
Miller, D. (2008). Quantum Mechanics for Scientists and Engineers. Cambridge: Cambridge Univesity Press.
Preskill, J. (2020). Quantum Information. California Institute of Technology. Cambridge University Press. Obtenido de http://theory.caltech.edu/~preskill/ph219/chap6_20_6A.pdf
Shor, P. (1994). Polynomial-Time Algorithms for Prime factorization and Discrete Logarithms on a Quantum Computer. Proceedings of the 35th Annual Symposium on Foundatios of Computer Science, pp 124-134.
Ulises, D. (2019). Agoritmos Fundamentales en Computación Cuántica. Sevilla. Obtenido de https://docplayer.es/191990088-Algoritmos-fundamentales-en-computacion-cuantica- pastor-diaz-ulises.html
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
