Unitary Decomposition

Implemented in the OpenQL programming language for quantum computation

Master thesis (2019)

Authors

A.M. Krol Electrical Engineering, Mathematics and Computer Science

Contributors

K.L.M. Bertels FTQC/Bertels Lab (mentor)
Imran Ashraf FTQC/Bertels Lab (graduation committee member)
M. Möller Numerical Analysis (graduation committee member)
Zaid Al-Ars Computer Engineering (graduation committee member)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
Copyright: © 2019 Anneriet Krol
More Info
expand_more

Published Date

13-09-2019

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

Unitary Decomposition is an algorithm for translating a unitary matrix into many small unitary matrices, which correspond to a circuit that can be executed on a quantum computer. It is implemented in the quantum programming framework of the QCA-group at TU Delft: OpenQL, a library for Python and C++. Unitary Decomposition is a necessary part in Quantum Associative Memory, an algorithm used in Quantum Genome Sequencing. The implementation is faster than other known implementations, and generates $3*2^{n-1}*(2^n-1)$ rotation gates for an n-qubit input gate. This is not the least-known nor the theoretical minimum amount, and there are some optimizations that can still be done to make it closer to these numbers.

Files

Unitary_Decomposition_in_OpenQ... (pdf)
(pdf | 3.39 Mb)
Unknown license