Dieulefait, L. V. (Luis Victor)Cano Pradas, Juan2022-09-212022-09-212022-06-13https://hdl.handle.net/2445/189222Treballs Finals de Grau d'Enginyeria Informàtica, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2022, Director: Luis Victor Dieulefait[en] The aim of this project is to study the Shor’s factorization algorithm, as well as some of its variants, both from a theoretical and practical point of view. First, the mathematical foundations on which it is based are presented, as well as the formalization of the notation used in quantum computing. Next, Shor’s algorithm and some variants are detailed in order to make it more efficient. Finally, a practical Python implementation of Shor’s quantum algorithm is carried out using IBM’s Qiskit library and also another implementation of Ekerå’s algorithm in SageMath.63 p.application/pdfspamemòria: cc-nc-nd (c) Juan Cano Pradas, 2022codi: GPL (c) Juan Cano Pradas, 2022http://creativecommons.org/licenses/by-nc-nd/3.0/es/http://www.gnu.org/licenses/gpl-3.0.ca.htmlFactorització (Matemàtica)Algorismes computacionalsProgramariTreballs de fi de grauOrdinadors quànticsFactorization (Mathematics)Computer algorithmsComputer softwareQuantum computersBachelor's thesesinfo:eu-repo/semantics/bachelorThesisinfo:eu-repo/semantics/openAccess