Physical Review A · 1996 · 181 citations · 19 references
ComputingComputer SciencePhysicsAlgorithmsQuantum ComputingQuantum MechanicsApproximation MethodsQuantum AlgorithmsQuantum ComputationQuantum DecoherenceQuantum Fourier TransformQuantum Information TheoryApproximate Quantum Fourier TransformPeriodicityQuantum Networks
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. \textcopyright{} 1996 The American Physical Society.
19
An algorithm for the machine calculation of complex Fourier series
J.W. Cooley, John W. Tukey · Mathematics of Computation · 1965 · 12.2K citations
The Art of Computer Programming
G.E. Whitesides · Nuclear Science and Engineering · 1970 · 6.1K citations
Quantum Computations with Cold Trapped Ions
J. I. Cirac, P. Zoller · Physical Review Letters · 1995 · 3.7K citations
Computing, Computer Science, Physics +17
Decoherence and the Transition from Quantum to Classical
Wojciech H. Zurek · Physics Today · 1991 · 2.6K citations