Trabajo Fin de Máster
Algoritmos fundamentales en computación cuántica
Autor/es | Pastor Díaz, Ulises |
Director | Tornero Sánchez, José María |
Departamento | Universidad de Sevilla. Departamento de álgebra |
Fecha de publicación | 2019 |
Fecha de depósito | 2020-02-26 |
Titulación | Universidad de Sevilla. Máster Universitario en Matemáticas |
Resumen | At any point in history, we can find examples of problems solved mechanically, but it was in the 20th century with the arrival of computers that the paradigm shifted and the concept of problem-solving changed forever. It ... At any point in history, we can find examples of problems solved mechanically, but it was in the 20th century with the arrival of computers that the paradigm shifted and the concept of problem-solving changed forever. It is at that moment when we start a race to not only solve problems but to solve them efficiently. A race against time itself. Many advances were made from that point on, but already in the childhood of computer science, a question clouded the horizon: how fast can we go? Are there problems which we cannot solve efficiently? In 1982 American physicist Richard Feynman pointed out that quantum systems could not be efficiently simulated with classical computers, proposing the idea of constructing a new model of computation. Computers fueled not by classical physics, but by quantum physics instead. This idea, which had already been introduced by American physicist Paul Benioff and Russian mathematician Yuri Manin in 1980, served as inspiration for British physicist David Deutsch to introduce in 1985 a quantum analog to the already well known Turing machines: a quantum Turing machine. And thus quantum computing was born. This new tool, which opened a new universe of possibilities, has been developed ever since, and many peaks have been reached in its short life. In 1994 American mathematician Peter W. Shor reached a milestone when he developed a quantum algorithm that solved the factoring problem in polynomial time. This achievement was soon followed by Indian-American Lov K. Grover, who in 1996 described a quantum algorithm that solved the search problem quadratically faster than a classical computer. In this memory our goal will be to present some of the main algorithms in quantum computing, but to do so we will have to start by introducing the postulates of quantum mechanics and the phenomenon of quantum entanglement. Next, we will propose a quantum computing model based on those ideas, which will allow us to finally construct some of the most important quantum algorithms so far. |
Cita | Pastor Díaz, U. (2019). Algoritmos fundamentales en computación cuántica. (Trabajo Fin de Máster Inédito). Universidad de Sevilla, Sevilla. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Pastor Díaz Ulises TFM.pdf | 698.2Kb | [PDF] | Ver/ | |