Fast versions of Shor's quantum factoring algorithm
量子物理
2007-05-23 v1
摘要
We present fast and highly parallelized versions of Shor's algorithm. With a sizable quantum computer it would then be possible to factor numbers with millions of digits. The main algorithm presented here uses FFT-based fast integer multiplication. The quick reader can just read the introduction and the ``Results'' section.
引用
@article{arxiv.quant-ph/9806084,
title = {Fast versions of Shor's quantum factoring algorithm},
author = {Christof Zalka},
journal= {arXiv preprint arXiv:quant-ph/9806084},
year = {2007}
}
备注
37 pages, LaTeX, 1 figure