Quantum Computing and Shor`s Factoring Algorithm
Igor V. Volovich
TL;DR
This paper provides an overview of quantum computing principles, focusing on Shor's algorithm for integer factoring, highlighting its components, complexity, and implications for computational problems.
Contribution
It offers a comprehensive explanation of Shor's algorithm and its significance in quantum computing and number theory.
Findings
Shor's algorithm efficiently factors integers using quantum Fourier transform.
Quantum algorithms can solve certain problems faster than classical algorithms.
The paper discusses the computational complexity of quantum factoring.
Abstract
Lectures on quantum computing. Contents: Algorithms. Quantum circuits. Quantum Fourier transform. Elements of number theory. Modular exponentiation. Shor`s algorithm for finding the order. Computational complexity of Schor`s algorithm. Factoring integers. NP-complete problems.
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 · Quantum Information and Cryptography · Quantum Mechanics and Applications