### Skapa referens, olika format (klipp och klistra)

**Harvard**

Stigsson, A. (2018) *A Taxonomy of Quantum Algorithms - The core ideas of existing quantum algorithms and their implications on cryptography*. Göteborg : Chalmers University of Technology

** BibTeX **

@mastersthesis{

Stigsson2018,

author={Stigsson, Anders},

title={A Taxonomy of Quantum Algorithms - The core ideas of existing quantum algorithms and their implications on cryptography},

abstract={With quantum computers coming up as one of the fastest growing areas in multiple
research areas, such as computer science and physics, a taxonomy of the existing
quantum algorithms is necessary. However, before this thesis, no taxonomy which included
many of the existing quantum algorithms could be found. We have filled that
gap with this thesis. The result is a taxonomy with 31 algorithms. Each algorithm
are classified into different groups depending on the characteristics and the core idea
that the algorithm uses. We have focused on three different core ideas distributed as
33% using the Quantum Fourier Transform, 27% uses Amplitude Amplification and
15% uses Quantum Walks with the remaining 25% being classified as "Other". On
top of this, we also discuss the security implications on the cryptographic schemes
used today, once quantum computers become reality. A taxonomy about an area
that expands as fast as quantum computing is never finished, but we believe that
this thesis provides a good base for future work in the area. This thesis can also be
used as an introduction to quantum computing for students with a base knowledge
about computer science and mathematics.},

publisher={Institutionen för data- och informationsteknik (Chalmers), Chalmers tekniska högskola},

place={Göteborg},

year={2018},

keywords={quantum computers, quantum algorithms, computer science, cryptography},

note={46},

}

** RefWorks **

RT Generic

SR Electronic

ID 255950

A1 Stigsson, Anders

T1 A Taxonomy of Quantum Algorithms - The core ideas of existing quantum algorithms and their implications on cryptography

YR 2018

AB With quantum computers coming up as one of the fastest growing areas in multiple
research areas, such as computer science and physics, a taxonomy of the existing
quantum algorithms is necessary. However, before this thesis, no taxonomy which included
many of the existing quantum algorithms could be found. We have filled that
gap with this thesis. The result is a taxonomy with 31 algorithms. Each algorithm
are classified into different groups depending on the characteristics and the core idea
that the algorithm uses. We have focused on three different core ideas distributed as
33% using the Quantum Fourier Transform, 27% uses Amplitude Amplification and
15% uses Quantum Walks with the remaining 25% being classified as "Other". On
top of this, we also discuss the security implications on the cryptographic schemes
used today, once quantum computers become reality. A taxonomy about an area
that expands as fast as quantum computing is never finished, but we believe that
this thesis provides a good base for future work in the area. This thesis can also be
used as an introduction to quantum computing for students with a base knowledge
about computer science and mathematics.

PB Institutionen för data- och informationsteknik (Chalmers), Chalmers tekniska högskola,

LA eng

LK http://publications.lib.chalmers.se/records/fulltext/255950/255950.pdf

OL 30