Abstract
We discuss the advantages of using the approximate quantum Fourier transform (AQFT) in algorithms which involve periodicity estimations. We analyze quantum networks performing AQFT in the presence of decoherence and show that extensive approximations can be made before the accuracy of AQFT (as compared with regular quantum Fourier transform) is compromised. We show that for some computations an approximation may imply a better performance. © 1996 The American Physical Society.
- Received 17 January 1996
DOI:https://doi.org/10.1103/PhysRevA.54.139
©1996 American Physical Society