Shor’s factoring algorithm.
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.
Adapted from https://github.com/ttlion/ShorAlgQiskit
None]) – Quantum Instance or Backend
Construct quantum part of the algorithm.
Execute the algorithm.
Returns the modular multiplicative inverse of a with respect to the modulus m.
Returns quantum instance.
- Return type