Approximate quantum Fourier transform and decoherence

1996/01/21 by Adriano Barenco, Artur Ekert, Kalle-Antti Suominen +2 · 3 citations
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum and electron transport phenomena #quant-ph

paper · pdf · doi:10.1103/physreva.54.139

14 pages, 10 fig. (8 *.eps files). More information on http://eve.physics.ox.ac.uk/QChome.html http://www.physics.helsinki.fi/~kasuomin http://www.physics.helsinki.fi/~kira/group.html

arxiv created 1996/01/21 · openalex publication_date 1996/07/01 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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. \textcopyright 1996 The American Physical Society.

Citations

• Semiclassical Fourier Transform for Quantum Computation
• An algorithm for the machine calculation of complex Fourier series

Cited by

• Phase-Fidelity-Aware Truncated Quantum Fourier Transform for Scalable Phase Estimation on NISQ Hardware
• Efficient classical simulation of the approximate quantum Fourier transform
• Construction of Boolean Logic Gates Using QFT-Based Adder Architecture