Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Primer on Quantum ComputingShor’s Algorithm for Integer Factorization

A Primer on Quantum Computing: Shor’s Algorithm for Integer Factorization [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.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A Primer on Quantum ComputingShor’s Algorithm for Integer Factorization

Loading next page...
 
/lp/springer-journals/a-primer-on-quantum-computing-shor-s-algorithm-for-integer-0f6S9fEGHm
Publisher
Springer International Publishing
Copyright
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2019
ISBN
978-3-030-19065-1
Pages
57 –77
DOI
10.1007/978-3-030-19066-8_4
Publisher site
See Chapter on Publisher Site

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.]

Published: Jun 26, 2019

There are no references for this article.