Quantum Algorithms and their Implementation on Quantum Computer Simulators

Quantum Algorithms and their Implementation on Quantum Computer Simulators

van der Lans, Mike (TU Delft Applied Sciences; TU Delft Electrical Engineering, Mathematics and Computer Science)

García Almudever, Carmina (mentor)
Möller, Matthias (mentor)
Groenevelt, Wolter (graduation committee)
Elkouss Coronas, David (graduation committee)

Delft University of Technology

2018-06-22

Quantum computation is becoming an increasingly interesting field, especially with the rise of real quantum computers. However, current quantum processors contain a few tens of error-prone qubits and the realization of large-scale quantum computers is still very challenging. Therefore, quantum computer simulators are particularly suitable for testing and analysing quantum algorithms without having a real quantum computer at one's disposal. In this thesis, different quantum algorithms such as Grover's and Shor's algorithm as well as key quantum routines such as the Quantum Fourier Transform (QFT) and a quantum adder/subtractor are described and analysed (optimal number of iterations, time complexity). Some of them have been implemented for an arbitrary number of qubits and have been simulated using two different quantum simulators, the QX simulator developed at QuTech and the Liquid simulator from Microsoft. In addition, how errors affect the success rate of the algorithms has been investigated.

quantum algorithms
quantum computing
QX Simulator
Microsoft Liquid
Grover's algorithm
Shor's algorithm

http://resolver.tudelft.nl/uuid:f05164dd-b853-41a1-a9e9-394cb7a1105e

Student theses

bachelor thesis

© 2018 Mike van der Lans