1. Beauregard, S.: Circuit for Shor’s algorithm using 2n+3 qubits. Quant. Inf. Comput. 3(2), 175–185 (2003)
2. Burges, C.J.C.: Factoring as Optimization. Microsoft Research, MSR-TR-200 (2002)
3. Dattani, N.S., Bryans, N.: Quantum factorization of 56153 with only 4 qubits,
arXiv:1411.6758
[quant-ph] (2014)
4. Dridi, R., Alghassi, H.: Prime factorization using quantum annealing and computational algebraic geometry. Sci. Rep. 7(1), 43048 (2017)
5. Ekerå, M.: Modifying Shor’s algorithm to compute short discrete logarithms. IACR Cryptology ePrint Archive (2016)