A presentation of the quantum Fourier transform from a recursive viewpoint

2004/11/10 by Gloria Paradisi, Paradisi, Gloria, Hugues Randriam +1
Physics and Astronomy · #FOS: Physical sciences #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #quant-ph

paper · pdf · doi:10.48550/arxiv.quant-ph/0411069

6 pages, 3 figures, purely pedagogical paper

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

Abstract

In this note we construct a quantum Fourier transform circuit in a recursive way, by directly copying the 'divide and conquer' construction of the fast Fourier transform algorithm, rather than using the explicit formula that is given in most introductory texts to quantum computation. We do not pretend this presentation to be original, nor claim for any anteriority. The aim of this paper is purely pedagogical.

Related

• Exploiting recursive structures for the design of novel quantum primitives
• Exact quantum Fourier transforms and discrete logarithm algorithms
• A novel quantum circuit for the quantum Fourier transform
• A quantum Fourier transform algorithm
• A Faster Quantum Fourier Transform