Factoring integers via Schnorr's algorithm assisted with VQE
Abstract
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 in classical computers hundreds or even thousands of years to complete. However, there exist some quantum algorithms that might be able to factor integers theoretically -- the theory works properly, but the hardware requirements are far away from what we can build nowadays -- and, for instance, Yan, B. et al. ([14]) claim to have constructed a hybrid algorithm which could be able even to challenge RSA-2048 in the near future. This work analyses this article and replicates the experiments they carried out, but with a different quantum method (VQE), being able to factor the number 1961.
Cite
@article{arxiv.2411.16632,
title = {Factoring integers via Schnorr's algorithm assisted with VQE},
author = {Luis Sánchez Cano and Ginés Carrascal de las Heras and Guillermo Botella Juan and Alberto del Barrio García},
journal= {arXiv preprint arXiv:2411.16632},
year = {2024}
}
Comments
12 pages, 1 algortihm, 1 figure, 2 tables