Approximate Quantum Fourier Transform and Decoherence
classification
🪐 quant-ph
keywords
quantumaqftfouriertransformapproximatedecoherenceaccuracyadvantages
read the original abstract
We discuss the advantages of using the approximate quantum Fourier transform (AQFT) in algorithms which involve periodicity estimations. We analyse 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.