Prime Factorization in the Duality Computer
量子物理
2015-06-26 v1
摘要
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.
引用
@article{arxiv.quant-ph/0607026,
title = {Prime Factorization in the Duality Computer},
author = {Wan-Ying Wang and Bin Shang and Chuan Wang and Gui Lu Long},
journal= {arXiv preprint arXiv:quant-ph/0607026},
year = {2015}
}
备注
4 pages