Please use this identifier to cite or link to this item:
http://hdl.handle.net/2445/186863
Title: | El problema del subgrup amagat |
Author: | Serrallonga Rosell, Guillem |
Director/Tutor: | Travesa i Grau, Artur |
Keywords: | Factorització (Matemàtica) Treballs de fi de grau Teoria de nombres Teoria de la computació Algorismes computacionals Teoria quàntica Factorization (Mathematics) Bachelor's theses Number theory Theory of computation Computer algorithms Quantum theory |
Issue Date: | 24-Jan-2022 |
Abstract: | [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. |
Note: | Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2022, Director: Artur Travesa i Grau |
URI: | http://hdl.handle.net/2445/186863 |
Appears in Collections: | Treballs Finals de Grau (TFG) - Matemàtiques |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
tfg_serrallonga_rosell_guillem.pdf | Memòria | 625.85 kB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License