Shor's Quantum Factoring Algorithm
Samuel J. Lomonaco, Jr
TL;DR
This paper explains Peter Shor's quantum algorithm for factoring large integers, highlighting its significance in quantum computing and cryptography.
Contribution
It provides a clear, lecture-based overview of Shor's algorithm, emphasizing its importance and foundational role in quantum algorithms.
Findings
Demonstrates how Shor's algorithm factors integers efficiently
Highlights implications for cryptography and security
Serves as an educational resource for quantum computing
Abstract
This paper is a written version of a one hour lecture given on Peter Shor's quantum factoring algorithm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture