论文信息 - An approximate Fourier transform useful in quantum factoring

An approximate Fourier transform useful in quantum factoring

We define an approximate version of the Fourier transform on $2^L$ elements, which is computationally attractive in a certain setting, and which may find application to the problem of factoring integers with a quantum computer as is currently under investigation by Peter Shor. (1994 IBM Internal Report)

D. Coppersmith

[1] Lynn Conway,et al. Introduction to VLSI systems , 1978 .

[2] Donald E. Knuth,et al. The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[3] Peter W. Shor,et al. Algorithms for Quantum Computation: Discrete Log and Factoring (Extended Abstract) , 1994, FOCS 1994.