论文信息 - Fast versions of Shor's quantum factoring algorithm

Fast versions of Shor's quantum factoring algorithm

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.

Christof Zalka

[1] D. Gottesman. Theory of fault-tolerant quantum computation , 1997, quant-ph/9702029.

[2] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[3] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[4] Peter W. Shor. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1999 .

[5] J. Cirac,et al. Quantum State Transfer and Entanglement Distribution among Distant Nodes in a Quantum Network , 1996, quant-ph/9611017.

[6] John J. Bollinger,et al. Atomic physics in ion traps , 1997 .

[7] J. Cirac,et al. Quantum Computations with Cold Trapped Ions. , 1995, Physical review letters.