A theoretical approach to Shor’s Algorithm and Quantum Bits

Categoria: Seminari e Convegni

Stato: Corrente

on Zoom

Seminario di De Cifris Augustae Taurinorum, in collaborazione con il Dipartimento di Scienze Matematiche 'G.L. Lagrange' del Politecnico di Torino, il Dipartimento di Matematica 'G. Peano' dell'Università degli Studi di Torino, Quadrans Foundation e Telsy SPA.

'A theoretical approach to Shor's Algorithm and Quantum Bits'
Francesco Stocco - Telsy
Venerdì 26 marzo 2021 - ore 14:30
Webinar

Sarà possibile seguire live il seminario mediante Zoom, attraverso il seguente link I
l seminario sarà tenuto in italiano.

Il client di Zoom esiste su ogni piattaforma e può essere scaricato gratuitamente al link

Abstract: In 1994, Peter W. Shor showed how to factor integers and to solve discrete logarithms in polynomial time, assuming a suitable quantum computer were available. In this seminar we will give a quick overview of the mathematical formalism behind quantum bits, providing the audience with the basic knowledge in quantum computing needed to approach Shor's algorithm for period finding. Given two coprime positive integers N and a, the algorithm computes the period of the function f(x)=ax mod N. The mathematical interpretation of the algorithm, in the framework of Hidden Subgroup Problem (HSP), will be the main subject of the talk. Furthermore, we will briefly show a couple of strategies to break RSA's protocol applying period finding.