Travesa i Grau, ArturSerrallonga Rosell, Guillem2022-06-212022-06-212022-01-24https://hdl.handle.net/2445/186863Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2022, Director: Artur Travesa i Grau[en] The hidden subgroup problem is a theoretical formalism which encompasses some problems of great importance, like factoring, discrete logarithm and graph isomorphism. Here we study Shor's algorithm for prime factorization and its relationship with the hidden subgroup problem. We start with an introduction to the theoretical framework of the hidden subgroup problem and some particular cases of this. Next we introduce the necessary concepts of the quantum computation circuit model in order to understand Shor's algorithm. Finally, we study those quantic algorithms which allow us to construct Shor's factoring algorithm.42 p.application/pdfcatcc-by-nc-nd (c) Guillem Serrallonga Rosell, 2022http://creativecommons.org/licenses/by-nc-nd/3.0/es/Factorització (Matemàtica)Treballs de fi de grauTeoria de nombresTeoria de la computacióAlgorismes computacionalsTeoria quànticaFactorization (Mathematics)Bachelor's thesesNumber theoryTheory of computationComputer algorithmsQuantum theoryinfo:eu-repo/semantics/bachelorThesisinfo:eu-repo/semantics/openAccess