# name
Computació quàntica: l’algoritme de Shor

# metadata.dc.description[].value
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2022, Director: Dieulefait, L. V.

# metadata.dc.description.abstract[].value
[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.

# metadata.dc.rights[].value
cc-by-nc-nd (c) Ariadna Celma Miralles, 2022

# metadata.dc.source[].value
Treballs Finals de Grau (TFG) - Matemàtiques

# metadata.dc.title[].value
Computació quàntica: l’algoritme de Shor