Please use this identifier to cite or link to this item:
http://hdl.handle.net/2445/186292| Title: | Computació quàntica: l’algoritme de Shor |
| Author: | Celma Miralles, Ariadna |
| Director/Tutor: | Dieulefait, L. V. (Luis Victor) |
| Keywords: | Factorització (Matemàtica) Treballs de fi de grau Ordinadors quàntics Teoria de nombres Algorismes computacionals Factorization (Mathematics) Bachelor's theses Quantum computers Number theory Computer algorithms |
| Issue Date: | 24-Jan-2022 |
| Abstract: | [en] This work introduces the bases of quantic computation to describe Shor’s algorithm. This algorithm allows us to factor a number N with polynomial speed. This implies a qualitative increase in calculation speed, since a quantic computer could calculate in hours or days what a classic computer may calculate in milion years. For that reason, criptographies like RSA may become obsolete, because factoring its public key and deciphering the message would be too quick. |
| Note: | Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2022, Director: Dieulefait, L. V. |
| URI: | http://hdl.handle.net/2445/186292 |
| Appears in Collections: | Treballs Finals de Grau (TFG) - Matemàtiques |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| tfg_celma_miralles_ariadna.pdf | Memòria | 4.42 MB | Adobe PDF | View/Open |
This item is licensed under a
Creative Commons License
