二次筛法分解量子算法及其仿真
Quadratic Sieve Factorization Quantum Algorithm and its Simulation
摘要:
量子计算是一个非常有吸引力的研究领域,它在量子水平上研究能量的行为和性质,以提高计算效率。近年来,量子计算因其与经典计算机相比能够有效地解决困难问题而备受关注。具体来说,一些著名的公钥密码系统依赖于分解大数的困难,这需要很长时间。预计到2020年,由于发现了强大的量子算法(Shor的因子分解,Grover的搜索算法等等),量子计算机的出现有可能打破这种密码系统。在本文中,我们设计了一个量子变种的第二快的经典因式分解算法命名为“二次筛”。利用高级程序设计语言Mathematica构建了量化二次筛法的仿真框架。此外,模拟结果在经典计算机上进行,以感受量子系统,并证明从计算复杂性的角度来看,它比其经典变体更有效。
英文摘要:
Quantum computing is a winsome field that concerns with the behaviour and nature of energy at the quantum level to improve the efficiency of computations. In recent years, quantum computation is receiving much attention for its capability to solve difficult problems efficiently in contrast to classical computers. Specifically, some well-known public-key cryptosystems depend on the difficulty of factoring large numbers, which takes a very long time. It is expected that the emergence of a quantum computer has the potential to break such cryptosystems by 2020 due to the discovery of powerful quantum algorithms (Shor's factoring, Grover's search algorithm and many more). In this paper, we have designed a quantum variant of the second fastest classical factorization algorithm named "Quadratic Sieve". We have constructed the simulation framework of quantized quadratic sieve algorithm using high-level programming language Mathematica. Further, the simulation results are performed on a classical computer to get a feel of the quantum system and proved that it is more efficient than its classical variants from computational complexity point of view.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。