Abstract
The Shor algorithm is widely regarded as the first non-trivial quantum algorithm that shows a potential of an ‘exponential’ speeding-up over its equivalent classical algorithms.
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
Notes
- 1.
One can try to use the 2020th and 2021th prime. Their product is 308 915 767. However, a laptop, after five hours, fails to find the cycle length.
References
Shor PW (1994) Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th annual symposium on foundations of computer science. IEEE, pp 124–134
Calderbank M (2007) The rsa cryptosystem: history, algorithm, primes. Chicago: Math. Uchicago. Edu
Mermin ND (2007) Quantum computer science. Cambridge University Press, UK
Michel LB (2006) A short introduction to quantum information and computation. Cambridge University Press, UK
Artur E, Richard J (1996) Quantum computation and shor’s factoring algorithm. Rev Mod Phys 68(3):733
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Baaquie, B.E., Kwek, LC. (2023). Shor’s Algorithm. In: Quantum Computers. Springer, Singapore. https://doi.org/10.1007/978-981-19-7517-2_13
Download citation
DOI: https://doi.org/10.1007/978-981-19-7517-2_13
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-7516-5
Online ISBN: 978-981-19-7517-2
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)