Year: 2021
Type: dissertation
Abstract: With quantum computers and quantum computing on the rise, promising significant speedups and new ways to compute using quantum phenomena, such as encryption or search, actually programming quantum computers is in many ways a challenge. Due to limitations of either the quantum hardware, specified in architectures, or the interactions quantum bits can perform on this hardware, translating arbitrary functions into something a quantum computer understands is in many ways hard. The limits of interactions between qubits, require restructuring and inserting new gates into existing quantum circuits, to change the positions of qubits. In many ways, not last due to the unpredictability and instability of quantum phenomena, the need to do this efficiently arises. To compare different methods that promise to achieve this, a baseline is needed, an exact methods that might not be competitive in terms of speed. This work improves upon one of these exact methods of computing a mapping from logical circuit to physical realization using Boolean satisfiability in order to provide more and better baselines for comparing inexact, heuristic methods. To this end, this work covers the basics of quantum computing and gives a short intro to SAT, followed by presenting the mapping problem as it exists, as well as some existing methods of solving this problem. It then goes on to discuss the problem with inexact methods and presents the SAT based exact solution. Finally some problems with this solution are presented and several ways in which this work seeked to solve these problems, or mitigate them, followed by experimental results of applying the ways presented.
Author: Schneider, Sarah
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7005003002