Prime Factorization in the Duality Computer
Wan-Ying Wang, Bin Shang, Chuan Wang, Gui Lu Long
Abstract
We give algorithms to factorize large integers in the duality computer. We provide three duality algorithms for factorization based on a naive factorization method, the Shor algorithm in quantum computing, and the Fermat's method in classical computing. All these algorithms are polynomial in the input size.
Create a lesson
Related papers
Marginal spectral distributions on regular bipartite unitary orbits
Lin Zhang
Quantum Imaginary Time Evolution on an Infinite 1D Chain
Hao-Ti Hung, Tung Tsao, Ying-Jer Kao
Exact quantum splitting and the structure of finite algebras
Muhammad Imran
Quantum-interference metrology of dissipative Kerr solitons
Yun-Ru Fan, Yong Geng, Ji Liu et al.
Indirect stabilization of N -level quantum systems
Francesca Carlotta Chittaro
Best Annealing Path of Quantum Annealing via Efficient Adiabatic Phase Transition
Kiyotaka Murashima