We investigate the optimization of Shor’s algorithm by exploring the factorization of N = 15 and N = 21. A simplified three-qubit circuit is found to successfully factor both cases when the testing integer numbers are appropriately chosen.
Herr et al. (Wed,) studied this question.