Last updated
2021-11-11T22:59:23.04+00:00
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.
(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.
Symplectic ID
313229
Download URL
http://arxiv.org/abs/quant-ph/9601018v1
Submitted to ORA
Off
Favourite
Off
Publication type
Journal Article
Publication date
21 Jan 1996