Shor’s algorithm for integer factorization

Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/341623

Type:	Outro documento
Title:	Shor’s algorithm for integer factorization
Author:	Marquezino, Franklin de Lima Portugal, Renato Lavor, Carlile
Abstract:	Shor’s algorithm is used to find the integer factors of a large number with exponential speed-up when compared to the best known classical algorithm. The idea behind this algorithm is to reduce the original problem to that of finding the order of an integer, and then to apply the Fourier transform
Subject:	Algoritmos
Country:	Alemanha
Editor:	Springer
Rights:	Fechado
Identifier DOI:	10.1007/978-3-030-19066-8_4
Address:	https://link.springer.com/chapter/10.1007/978-3-030-19066-8_4
Date Issue:	2019
Appears in Collections:	IMECC - Artigos e Outros Documentos

Files in This Item:

File	Description	Size	Format
2-s2.0-85068057200.pdf		835.33 kB	Adobe PDF	View/Open