Update week11.do.txt

Author: mhjensen

doc/src/week11/week11.do.txt

@@ -7,7 +7,7 @@ DATE: April 2, 2025
 ===== Plans for the week of March 31-April 4, 2025 =====
 
 !bblock 
-o Discrete Fourier transforms (DFTs, reminder from last week) ) and the fast Fourier Transform (FFT)
+o Discrete Fourier transforms (DFTs, reminder from last week) ) and the fast Fourier Transform (FFT) (additional slides)
 o Quantum Fourier transforms (QFTs), reminder from last week
 o Setting up circuits for QFT
 o Quantum phase estimation algorithm
@@ -52,7 +52,7 @@ algorithm. However the basics of the algorithm were known long before
 that, for example, it was known to Gauss back in 1805.
 To read more about Fast Fourier transforms and similar topics, see for example "Fast Fourier Transform - Algorithms and Applications":"https://link.springer.com/book/10.1007/978-1-4020-6629-0". See also URL:"https://github.com/CompPhysics/QuantumComputingMachineLearning/blob/gh-pages/doc/Textbooks/fastfourier.pdf"
 
-Our emphasis is on the link between discrete Fourier transforms and quantum Fourier transforms. We will not discuss FFT in this course.
+For a discussion of FFT, see additional slides at (address to be added)
 
 
 !split
@@ -217,21 +217,6 @@ f_{j}=\frac{1}{\sqrt{n}} \sum_{k=0}^{n-1} \omega^{j k} \tilde{f}_{k}=\frac{1}{\s
 !et
 
 
-
-
-
-!split
-===== Fast Fourier transform and polynomial multiplication =====
-
-
-The FFT algorithm is an $O(n\log{n})$ divide and conquer algorithm for DFT, used by
-Gauss circa 1805, and popularized by Cooley and Turkey and 1965. Gauss used the
-algorithm to determine periodic asteroid orbits, while Cooley and Turkey used it to
-detect Soviet nuclear tests from offshore readings.
-A practical implementation of FFT is FFTW, which was described by Frigo and
-Johnson at MIT. The algorithm is often implemented directly in hardware, for fixed $n$.
-
-
 !split
 ===== From DFT to QFT =====