Please use this identifier to cite or link to this item:
http://hdl.handle.net/2445/189222| Title: | Algunas variantes del algoritmo cuántico de Shor |
| Author: | Cano Pradas, Juan |
| Director/Tutor: | Dieulefait, L. V. (Luis Victor) |
| Keywords: | Factorització (Matemàtica) Algorismes computacionals Programari Treballs de fi de grau Ordinadors quàntics Factorization (Mathematics) Computer algorithms Computer software Quantum computers Bachelor's theses |
| Issue Date: | 13-Jun-2022 |
| Abstract: | [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. |
| Note: | Treballs Finals de Grau d'Enginyeria Informàtica, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2022, Director: Luis Victor Dieulefait |
| URI: | http://hdl.handle.net/2445/189222 |
| Appears in Collections: | Treballs Finals de Grau (TFG) - Enginyeria Informàtica Programari - Treballs de l'alumnat Treballs Finals de Grau (TFG) - Matemàtiques |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| codi.zip | Codi font | 524.93 kB | zip | View/Open |
| tfg_cano_pradas_juan.pdf | Memòria | 1.88 MB | Adobe PDF | View/Open |
This item is licensed under a
Creative Commons License
