Unitary Decomposition
Implemented in the OpenQL programming language for quantum computation
A.M. Krol (TU Delft - Electrical Engineering, Mathematics and Computer Science)
K.L.M. Bertels – Mentor (TU Delft - FTQC/Bertels Lab)
I. Ashraf – Graduation committee member (TU Delft - FTQC/Bertels Lab)
Matthias Möller – Graduation committee member (TU Delft - Numerical Analysis)
Zaid Al-Ars – Graduation committee member (TU Delft - Computer Engineering)
More Info
expand_more
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.
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.