Quantum Computing, Quantum, Quantum Physics, Shors Algorithm, Qiskit.
of the not-so-large prime numbers 3 and 5. N = 15 The first step is to choose a random number, a, between 1 and N-1: np.random.seed(1) # This is to make sure we get reproduceable results a = randint(2, 15) print(a) 7 Great. Next, we do Shor’s order finding algorithm for a = 7 and N = 15. Remember