Shor’s Algorithm

Detailed Resources to Understand the Algorithm:-

• Quantum Computing Resources - For Beginners
• Topcoder's Tutorial on Shor's Algorithm
• Wikipedia - For complete details of this algorithm

Basic Info:-

Shor’s algorithm was invented by Peter Shor for integer factorization in 1994. It finds the prime factors of an integer N. Quantum Fourier Transform is the basis of the algorithm which finds the period of the function which gives the value based on the product of the prime factors.

Complexity:-

Shor’s algorithm executes in polynomial time of O(log N) on a Quantum Computer and O((log N)3) on Classical Computers.

Live Contest for More Problems:-

• Topcoder's Fujitsu challenge – Quantum computing challenge using simulated annealing
• More To Be Added

Problem Statements

P-1. Implement Shor’s algorithm to prime factorise an integer N.

Implementation:- P1_shor_primefactorization.py

More To Be Added

Note:- Python 3.5 or Greater is Recommended for Compiling

---

<p align="center"> A massive collaborative effort by <a href="https://github.com/OpenGenus/cosmos">OpenGenus Foundation</a> </p>

---