Abstract
In this chapter we represent Shor’s quantum algorithm for factoring integers. Shor’s algorithm can be better understood after studying quantum Fourier transforms. The issues related to Fourier transforms and other mathematical details are handled in Chapter 8, but a reader having a solid mathematical knowledge of these concepts is advised to ignore the references to Chapter 8.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hirvensalo, M. (2001). Fast Factorization. In: Quantum Computing. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04461-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-04461-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-04463-6
Online ISBN: 978-3-662-04461-2
eBook Packages: Springer Book Archive