  Quantum integer factorization is a potential quantum computing solution that
may revolutionize cryptography. Nevertheless, a scalable and efficient quantum
algorithm for noisy intermediate-scale quantum computers looks far-fetched. We
propose an alternative factorization method, within the digitized-adiabatic
quantum computing paradigm, by digitizing an adiabatic quantum factorization
algorithm enhanced by shortcuts to adiabaticity techniques. We find that this
fast factorization algorithm is suitable for available gate-based quantum
computers. We test our quantum algorithm in an IBM quantum computer with up to
six qubits, surpassing the performance of the more commonly used factorization
algorithms on the long way towards quantum advantage.
