Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Montanaro (2015)
Quantum algorithms: an overviewnpj Quantum Information, 2
A. Ekert, R. Jozsa (1996)
Quantum Computation and Shor's Factoring AlgorithmReviews of Modern Physics, 68
S. Meiklejohn (2010)
Review of an introduction to mathematical cryptography by Jeffrey Hoffstein, Jill Pipher, and Joseph Silverman Springer-Verlag, 2008SIGACT News, 41
J. Pollard (1975)
A monte carlo method for factorizationBIT Numerical Mathematics, 15
R. Jozsa (1996)
Quantum factoring, discrete logarithms, and the hidden subgroup problemComput. Sci. Eng., 3
S. Lomonaco, Jr. (2000)
Shor's Quantum Factoring AlgorithmarXiv: Quantum Physics
Andrew Childs, W. Dam (2008)
Quantum algorithms for algebraic problemsReviews of Modern Physics, 82
P. Shor (1995)
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Rev., 41
R. Jozsa (1997)
Quantum algorithms and the Fourier transformProceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, 454
J. Cooley, J. Tukey (1965)
An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 19
J. Gathen, J. Gerhard (2002)
Modern computer algebraSIGACT News, 33
T. Monz, D. Nigg, E. Martinez, M. Brandl, P. Schindler, Rich Rines, Shannon Wang, I. Chuang, R. Blatt (2015)
Realization of a scalable Shor algorithmScience, 351
F. Marquezino, R. Portugal, F. Sasse (2010)
Obtaining the Quantum Fourier Transform from the classical FFT with QR decompositionJ. Comput. Appl. Math., 235
S. Lomonaco (2002)
Quantum Computation: A Grand Mathematical Challenge for the Twenty-First Century and the Millennium: American Mathematical Challenge Society, Short Course, January 17-18, 2000, Washington, DC
L. Vandersypen, M. Steffen, G. Breyta, C. Yannoni, M. Sherwood, I. Chuang (2001)
Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonanceNature, 414
Nikolay Raychev, I. Chuang (2010)
Quantum Computation and Quantum Information: Bibliography
D. Boneh, R. Lipton (1995)
Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract)
A. Kitaev (1995)
Quantum measurements and the Abelian Stabilizer ProblemElectron. Colloquium Comput. Complex., TR96
P. Shor (1994)
Algorithms for quantum computation: discrete logarithms and factoringProceedings 35th Annual Symposium on Foundations of Computer Science
G. Einarsson (2003)
Probability Analysis of a Quantum ComputerarXiv: Quantum Physics
William Ellison, Fern Ellison (1985)
Prime numbers
S. Wagstaff (2013)
The Joy of Factoring
H. Lenstra (1987)
Factoring integers with elliptic curvesAnnals of Mathematics, 126
M. Adhikari, A. Adhikari (2014)
Introduction to Mathematical Cryptography
D. Knuth (1968)
The Art of Computer Programming
[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
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.