Skip to main content

Emilia Dunfelt: Quantum Computing - From Shor's Algorithm to The Hidden Subgroup Problem

BSc Thesis Presentation

Time: Mon 2020-08-24 13.30 - 14.30

Lecturer: Emilia Dunfelt

Location: Zoom, meeting ID: 61236446099

Supervisor: Sven Raum


The following paper aims to present the basic theory of quantum computing, Shor’s algorithm, the graph isomorphism problem, and their connection to the hidden subgroup problem. A mathematical approach is taken to these concepts, in contrast to a physical or computer scientific focus. Each topic is introduced with an emphasis on Hilbert spaces, analytic number theory, representation theory, and group theory. First, Shor’s factoring algorithm is presented and summarized in detail, giving a complete overview of the factoring process. Then, after introducing basic notions of representation theory of finite groups, the standard method of quantum algorithms is presented in the context of the hidden subgroup framework. Finally, the graph isomorphism problem is discussed, and a brief overview of the current status of this problem is given.

Belongs to: Department of Mathematics
Last changed: Aug 20, 2020