Editing Shor's algorithm (section)

== Further reading ==
* {{cite book |last1=Nielsen |first1=Michael A. |last2=Chuang |first2=Isaac L. |title=Quantum Computation and Quantum Information: 10th Anniversary Edition |date=2010 |publisher=Cambridge University Press |isbn=978-1-107-00217-3 }}
* {{cite book |doi=10.1093/oso/9780198570004.001.0001 |title=An Introduction to Quantum Computing |date=2006 |last1=Kaye |first1=Phillip |last2=Laflamme |first2=Raymond |last3=Mosca |first3=Michele |isbn=978-0-19-857000-4 }}
* [http://scottaaronson.com/blog/?p=208 "Explanation for the man in the street"] by [[Scott Aaronson]], "[http://scottaaronson.com/blog/?p=208#comment-9958 approved]" by Peter Shor. (Shor wrote "Great article, Scott! That’s the best job of explaining quantum computing to the man on the street that I’ve seen."). An alternate metaphor for the QFT was presented in [http://www.scottaaronson.com/blog/?p=208#comment-5187 one of the comments]. Scott Aaronson suggests the following 12 references as further reading (out of "the 10<sup>10<sup>5000</sup></sup> quantum algorithm tutorials that are already on the web."):
* {{Citation |last=Shor |first=Peter W. |year=1997 |title=Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer |journal=SIAM J. Comput. |volume=26 |issue=5 |pages=1484–1509 |doi=10.1137/S0036144598347011 |arxiv=quant-ph/9508027v2|bibcode = 1999SIAMR..41..303S }}. Revised version of the original paper by Peter Shor ("28 pages, LaTeX. This is an expanded version of a paper that appeared in the Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, Nov. 20--22, 1994. Minor revisions made January, 1996").
* [https://quantum-algorithms.herokuapp.com/299/paper/index.html Quantum Computing and Shor's Algorithm], Matthew Hayward's [https://quantum-algorithms.herokuapp.com/ Quantum Algorithms Page], 2005-02-17, imsa.edu, LaTeX2HTML version of the original [https://quantum-algorithms.herokuapp.com/299/paper.tex LaTeX document], also available as [https://quantum-algorithms.herokuapp.com/299/paper.pdf PDF] or [https://quantum-algorithms.herokuapp.com/299/paper.ps postscript] document.
* [http://homepages.cwi.nl/~rdewolf/publ/qc/survey.ps Quantum Computation and Shor's Factoring Algorithm], Ronald de Wolf, CWI and University of Amsterdam, January 12, 1999, 9 page postscript document.
* [http://www.cs.berkeley.edu/~vazirani/f04quantum/notes/lec9.ps Shor's Factoring Algorithm], Notes from Lecture 9 of Berkeley CS 294–2, dated 4 Oct 2004, 7 page postscript document.
* [http://www.theory.caltech.edu/people/preskill/ph229/notes/chap6.ps Chapter 6 Quantum Computation] {{Webarchive|url=https://web.archive.org/web/20200430110523/http://www.theory.caltech.edu/people/preskill/ph229/notes/chap6.ps |date=2020-04-30 }}, 91 page postscript document, Caltech, Preskill, PH229.
* [http://www-users.cs.york.ac.uk/~schmuel/comp/comp.html Quantum computation: a tutorial] by [http://www.cs.york.ac.uk/~schmuel/ Samuel L. Braunstein].
* [http://www.cs.ucr.edu/~neal/1996/cosc185-S96/shor/high-level.html The Quantum States of Shor's Algorithm], by Neal Young, Last modified: Tue May 21 11:47:38 1996.
* [https://web.archive.org/web/20121115112940/http://people.ccmr.cornell.edu/~mermin/qcomp/chap3.pdf III. Breaking RSA Encryption with a Quantum Computer: Shor's Factoring Algorithm], Lecture notes on Quantum computation, Cornell University, Physics 481–681, CS 483; Spring, 2006 by N. David Mermin. Last revised 2006-03-28, 30 page PDF document.
* {{Cite arXiv|eprint=quant-ph/0303175|last1= Lavor|first1= C.|title= Shor's Algorithm for Factoring Large Integers|last2=  Manssur|first2= L. R. U.|last3=  Portugal|first3= R.|year= 2003}}
* {{Cite arXiv|eprint=quant-ph/0010034|last1=Lomonaco|first1=Jr|title=Shor's Quantum Factoring Algorithm|year=2000}}  This paper is a written version of a one-hour lecture given on Peter Shor's quantum factoring algorithm. 22 pages.
* [http://www.cs.princeton.edu/theory/complexity/quantumchap.pdf Chapter 20 Quantum Computation], from ''Computational Complexity: A Modern Approach'', Draft of a book: Dated January 2007, Sanjeev Arora and Boaz Barak, Princeton University. Published as Chapter 10 Quantum Computation of Sanjeev Arora, Boaz Barak, "Computational Complexity: A Modern Approach", Cambridge University Press, 2009, {{isbn|978-0-521-42426-4}}
* [http://blogs.discovermagazine.com/80beats/2011/01/19/a-step-towards-quantum-computing-entangling-10-billion-particles/ A Step Toward Quantum Computing: Entangling 10 Billion Particles] {{Webarchive|url=https://web.archive.org/web/20110120103006/http://blogs.discovermagazine.com/80beats/2011/01/19/a-step-towards-quantum-computing-entangling-10-billion-particles/ |date=2011-01-20 }}, from "Discover Magazine", Dated January 19, 2011.
* [http://www.fi.muni.cz/usr/gruska/survey1.ps Josef Gruska - ''Quantum Computing Challenges''] also in [https://www.amazon.com/Mathematics-Unlimited-Bj%C3%B6rn-Engquist/dp/3540669132 Mathematics unlimited: 2001 and beyond], Editors Björn Engquist, Wilfried Schmid, Springer, 2001, {{isbn|978-3-540-66913-5}}