Current asymmetric cryptography is based on the principle that while classical computers can efficiently multiply large integers,the inverse operation, factorization, is significantly more complex. For sufficiently large integers, this factorization process can take classical computers hundreds or even thousands of years to complete. However, there exist some quantum algorithms that might be able to factor integers theoretically and, for instance, Yan, B. et al. claim to have constructed a hybrid algorithm which could be able even to challenge RSA-2048 in the near future. This work analyses that article and replicates the experiments they carried out, but with a different quantum method (VQE), being able to factor the number 1961.