Please use this identifier to cite or link to this item:
Title: Efficient unitary approximations in quantum computing: the Solovay-Kitaev theorem
Author: Lumbreras Zarapico, Josep
Director/Tutor: Cirici, Joana
Keywords: Ordinadors quàntics
Treballs de fi de grau
Algorismes computacionals
Geometria computacional
Grups de Lie
Quantum computers
Bachelor's theses
Computer algorithms
Lie groups
Computational geometry
Issue Date: 18-Jan-2019
Abstract: [en] Over the past few years, quantum computing has become more plausible due to the great advances in technology. While quantum computers are on their birth, the underlying mathematics have evolved to the point of proving that some quantum algorithms can solve problems that were unsolvable in classic computers. In order to implement these algorithms in a real machine, it is important to develop efficient ways to do it. The Solovay-Kitaev Theorem states that is possible. This work pretends to offer a complete review of the Solovay- Kitaev Theorem giving all the necessary tools to prove it. Moreover, we offer a brief introduction to the standard mathematical model of quantum computing, based on unitary operations.
Note: Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2019, Director: Joana Cirici
Appears in Collections:Treballs Finals de Grau (TFG) - Matemàtiques

Files in This Item:
File Description SizeFormat 
TFG-Lumbreras-Zarapico-Josep.pdfMemòria447.01 kBAdobe PDFView/Open

This item is licensed under a Creative Commons License Creative Commons