Print Email Facebook Twitter Unitary Decomposition Title Unitary Decomposition: Implemented in the OpenQL programming language for quantum computation Author Krol, Anneriet (TU Delft Electrical Engineering, Mathematics and Computer Science; TU Delft QuTech) Contributor Bertels, Koen (mentor) Ashraf, Imran (graduation committee) Möller, Matthias (graduation committee) Al-Ars, Zaid (graduation committee) Degree granting institution Delft University of Technology Date 2019-09-13 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. Subject Unitary DecompositionOpenQLCompilersQuantum algorithms To reference this document use: http://resolver.tudelft.nl/uuid:9c60d13d-4f42-4d8b-bc23-5de92d7b9600 Part of collection Student theses Document type master thesis Rights © 2019 Anneriet Krol Files PDF Unitary_Decomposition_in_ ... E_2019.pdf 3.39 MB Close viewer /islandora/object/uuid:9c60d13d-4f42-4d8b-bc23-5de92d7b9600/datastream/OBJ/view