Show simple item record

dc.rights.licenseCC-BY-NC-ND
dc.contributor.advisorSlingerland, J.
dc.contributor.advisorMorais Smith, C. de
dc.contributor.authorBrunekreef, J.W.
dc.date.accessioned2014-08-26T17:01:21Z
dc.date.available2014-08-26T17:01:21Z
dc.date.issued2014
dc.identifier.urihttps://studenttheses.uu.nl/handle/20.500.12932/17738
dc.description.abstractA central problem in realizing universal quantum computers is dealing with decoherence effects, which can destroy the vulnerable quantum states present in the internal registers. Several schemes have been developed that provide resistance to decoherence, leading to theories of fault-tolerant quantum computation. One such scheme is the theory of topological quantum computation, which encodes qubit states in robust topological properties of certain quantum systems. However, fault-tolerant theories typically only provide a finite set of primitive gates, from which we must then form approximations to arbitrary quantum gates. The Solovay-Kitaev algorithm describes a procedure for accomplishing this, and proves that the number of primitive gates required to approximate an arbitrary gate is only polylogarithmic in the desired degree of accuracy. In this thesis, we first outline the basic theory of quantum computation. Secondly, we describe the general problem of quantum compilation, list several possible strategies for relevant optimizations, and outline a proof of the Solovay-Kitaev theorem. Next, we give an introduction to the theory of topological quantum computation by anyons, with special focus on Fibonacci-anyons. Finally, we list some numerical results of an implementation of the Solovay-Kitaev algorithm when applied to a Fibonacci-anyon model and analyze the performance gains obtained through applications of the proposed optimizations.
dc.description.sponsorshipUtrecht University
dc.format.extent766718
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.titleTopological Quantum Computation and Quantum Compilation
dc.type.contentBachelor Thesis
dc.rights.accessrightsOpen Access
dc.subject.keywordstopological quantum computation, quantum compilation, solovay-kitaev algorithm, anyons, quantum computation
dc.subject.courseuuNatuur- en Sterrenkunde


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record