Quantum Phylogeny

Specialeforsvar: David Salvador Novo

Titel: Quantum Phylogeny

Abstract: In this paper we will focus on its use in order to speed up the Minimal Steiner Tree (MST) computation as a means of constructing phylogenetic trees, which we will introduce in detail. In particular we will follow a paper by Le Gall et al. 2019 [14] which proposes an algorithm in order to do so and we will work on its practical implementation on an actual quantum computer. We suppose that the audience for this paper has prior knowledge in quantum computing, hence we will start with some background on the origins of quantum computing and a brief introduction to phylogenetics and its relation to the MST problem. Then we will present the main algorithm proposed by Le Gall and the theory behind the quantum algorithms needed in order to implement their algorithm. We will end this paper with the practical implementation of these using the IBM quantum software Qiskit and a proposal for the practical implementation of Le Galls algorithm.

Vejleder: Albert Werner
Censor:   René Bødker Christensen,  Aalborg Universitet