借助VQE辅助的Schnorr算法进行整数分解
Factoring integers via Schnorr's algorithm assisted with VQE
AI总结：
本文针对经典计算机难以高效分解大整数的问题，复现并分析了Yan等人的混合量子分解算法，改用VQE量子方法成功分解了数字1961，验证了该路线的可行性。
摘要：
当前的非对称密码学基于这样一个原理：经典计算机虽然能够高效地完成大整数乘法，但其逆运算——因数分解——却复杂得多。对于足够大的整数，这一因数分解过程在经典计算机上可能需要数百年甚至数千年才能完成。然而，存在一些量子算法在理论上或许能够分解整数——其理论本身是可行的，但硬件需求远远超出了我们目前所能构建的水平——例如，Yan, B.等人（[14]）声称构建了一种混合算法，甚至可能在不久的将来挑战RSA-2048。本文分析了该文章，并复现了他们所进行的实验，但采用了不同的量子方法（VQE），成功分解了数字1961。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
