Quantum Algorithms
"Shor’s Factoring algorithm is one of the most well-known quantum algorithms and finds the prime factors for input integer N in polynomial time." The algorithm solves the problem, "given an integer, N, find its prime factors.
The Story Behind Shor's Algorithm
References:
- It’s been 20 years since “15” was factored on quantum hardware:
https://research.ibm.com/blog/factor-15-shors-algorithm - Shor's Algorithm:
https://en.wikipedia.org/wiki/Shor%27s_algorithm - Shor's algorithm in Qiskit:
https://github.com/ttlion/ShorAlgQiskit - Shor's Algorithm - Programming on Quantum Computers - Coding with Qiskit
https://www.youtube.com/watch?v=EdJ7RoWcU48 - Qiskit:
https://qiskit.org
https://qiskit.org/documentation/stubs/qiskit.algorithms.Shor.html - Basic Qiskit Syntax:
https://qiskit.org/textbook/ch-appendix/qiskit.html - Learn in Qiskit:
https://qiskit.org/learn/ - Qiskit Documentation:
https://qiskit.org/documentation/index.html