dc.contributorMarcelo de Oliveira Terra Cunha
dc.contributorPaulo Antonio Fonseca Machado
dc.contributorBernardo Nunes Borges de Lima
dc.creatorAdriana Xavier Freitas
dc.date.accessioned2019-08-09T16:19:06Z
dc.date.accessioned2022-10-03T23:01:01Z
dc.date.available2019-08-09T16:19:06Z
dc.date.available2022-10-03T23:01:01Z
dc.date.created2019-08-09T16:19:06Z
dc.date.issued2010-02-18
dc.identifierhttp://hdl.handle.net/1843/EABA-85FJXP
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/3815183
dc.description.abstractShors algorithm is a quantum algorithm that finds with high probability the order of an element $x \in Z_{N}^{*}$. One of its applications is the construction of an algorithm that finds the factors of N. In the initial chapters we approach necessary tools for the comprehension of Shors algorithm such as: modular arithmetic, algorithms, continued fractions, basic concepts of quantum computing and Fourier quantum transform. In the following chapters we present Shors algorithm an its application in factorization.
dc.publisherUniversidade Federal de Minas Gerais
dc.publisherUFMG
dc.rightsAcesso Aberto
dc.subjectalgoritmo de Shor
dc.titleAlgoritmo de Shor e sua aplicação à fatoração de números inteiros
dc.typeDissertação de Mestrado


Este ítem pertenece a la siguiente institución