论文标题
二次筛分分数量子算法及其模拟
Quadratic Sieve Factorization Quantum Algorithm and its Simulation
论文作者
论文摘要
量子计算是一个有趣的领域，涉及量子水平上能量的行为和性质以提高计算效率。近年来，与古典计算机相比，量子计算的能力有效地解决了难题的能力。具体来说，一些著名的公钥密码系统取决于分解大量的困难，这需要很长时间。预计由于发现了强大的量子算法（Shor的保理，Grover的搜索算法等），量子计算机的出现可能会在2020年到2020年打破此类隐型系统。在本文中，我们设计了名为“二次筛”的第二快经典分解算法的量子变体。我们已经使用高级编程语言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.
