https://github.com/aru71727/quantum-factoring21
Shor’s algorithm is a quantum algorithm for factoring a number N in O((log N)3) time and O(log N) space,
https://github.com/aru71727/quantum-factoring21
factor factor-analysis factorization factorization-algorithm python3 quantum quantum-algorithms quantum-computing
Last synced: 7 months ago
JSON representation
Shor’s algorithm is a quantum algorithm for factoring a number N in O((log N)3) time and O(log N) space,
- Host: GitHub
- URL: https://github.com/aru71727/quantum-factoring21
- Owner: aru71727
- Created: 2020-05-05T10:45:42.000Z (over 5 years ago)
- Default Branch: master
- Last Pushed: 2020-05-07T06:51:46.000Z (over 5 years ago)
- Last Synced: 2025-01-26T15:33:05.183Z (9 months ago)
- Topics: factor, factor-analysis, factorization, factorization-algorithm, python3, quantum, quantum-algorithms, quantum-computing
- Language: Jupyter Notebook
- Homepage:
- Size: 11.7 KB
- Stars: 2
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Quantum-Factoring21
Shor’s algorithm is a quantum algorithm for factoring a number N in O((log N)3) time and O(log N) space, named after Peter Shor.
The problem we are trying to solve is that, given an integer N, we try to find another integer p between 1 and N that divides N.
Shor’s algorithm consists of two parts:
1. A reduction of the factoring problem to the problem of order-finding, which can be done on a classical computer.
2. A quantum algorithm to solve the order-finding problem.
Note: For this you will need an API token which you can get by registering here: https://quantum-computing.ibm.com/
//run on IBM’s quantum computers with Python and Qiskit.
For detailed explanantion
visit blog : https://medium.com/@kush.aradhana007/shors-factoring-algorithm-cd70802e0544