Create qft.tex

Author: mhjensen

doc/src/week10/Latexslides/qft.tex

@@ -0,0 +1,119 @@
+\documentclass{beamer}
+\usepackage{graphicx}
+\usepackage{amsmath}
+\usepackage{amssymb}
+\usepackage{qcircuit} % For quantum circuit diagrams
+
+\title{Advantages of Quantum Fourier Transform (QFT)}
+\author{Morten HJ}
+\date{Old slides from 2005, slightly revised}
+
+\begin{document}
+
+\begin{frame}
+    \titlepage
+\end{frame}
+
+% Introduction
+\begin{frame}{Introduction to Quantum Fourier Transform (QFT)}
+    \begin{itemize}
+        \item QFT is the quantum analogue of the Discrete Fourier Transform (DFT).
+        \item It plays a crucial role in quantum algorithms like Shor’s Algorithm and Quantum Phase Estimation.
+        \item QFT provides an **exponential speedup** over classical Fourier Transform methods.
+    \end{itemize}
+\end{frame}
+
+% QFT Definition
+\begin{frame}{Mathematical Definition of QFT}
+    \textbf{QFT on an n-qubit register:}
+    \[
+    \text{QFT} |x\rangle = \frac{1}{\sqrt{2^n}} \sum_{k=0}^{2^n-1} e^{2\pi i x k / 2^n} |k\rangle
+    \]
+    where \( x \) is the computational basis state.
+\end{frame}
+
+% Exponential Speedup
+\begin{frame}{Advantage 1: Exponential Speedup}
+    \begin{itemize}
+        \item Classical Discrete Fourier Transform (DFT) requires \( O(N^2) \) operations.
+        \item The Fast Fourier Transform (FFT) improves this to \( O(N \log N) \).
+        \item QFT reduces complexity to **\( O((\log N)^2) \)** using quantum gates.
+    \end{itemize}
+\end{frame}
+
+% Quantum Parallelism
+\begin{frame}{Advantage 2: Quantum Parallelism}
+    \begin{itemize}
+        \item QFT acts on a **superposition** of states, processing all inputs simultaneously.
+        \item This is crucial in algorithms like:
+        \begin{itemize}
+            \item Shor’s Algorithm for factoring large numbers.
+            \item Quantum Phase Estimation (QPE) for eigenvalue extraction.
+        \end{itemize}
+    \end{itemize}
+\end{frame}
+
+% Compact Circuit Implementation
+\begin{frame}{Advantage 3: Compact Circuit Implementation}
+    \begin{itemize}
+        \item QFT requires only **Hadamard gates and controlled-phase gates**.
+        \item A 3-qubit QFT circuit uses only \( O(n^2) \) gates.
+        \item This makes QFT highly efficient for **quantum hardware**.
+    \end{itemize}
+\end{frame}
+
+% Applications
+\begin{frame}{Advantage 4: Applications in Quantum Computing}
+    \begin{itemize}
+        \item \textbf{Shor’s Algorithm:} Uses QFT to find periodicity in modular exponentiation.
+        \item \textbf{Quantum Phase Estimation (QPE):} Extracts eigenvalues of unitary matrices.
+        \item \textbf{Quantum Signal Processing:} Enables spectral analysis on quantum data.
+    \end{itemize}
+\end{frame}
+
+% Memory Complexity
+\begin{frame}{Advantage 5: Reduced Memory Complexity}
+    \begin{itemize}
+        \item Classical DFT requires \( O(N) \) space.
+        \item QFT stores Fourier-transformed coefficients **implicitly** in qubit amplitudes.
+        \item Only **\( O(n) \) qubits** are needed for a size \( N = 2^n \) transformation.
+    \end{itemize}
+\end{frame}
+
+% Quantum Signal Processing
+\begin{frame}{Advantage 6: Quantum Signal Processing}
+    \begin{itemize}
+        \item QFT enables applications such as:
+        \begin{itemize}
+            \item Quantum spectral analysis.
+            \item Quantum image processing.
+            \item Quantum filtering and denoising.
+        \end{itemize}
+        \item These can enhance AI, cryptography, and data processing.
+    \end{itemize}
+\end{frame}
+
+% QFT Circuit Example
+\begin{frame}{Quantum Fourier Transform Circuit}
+    \begin{center}
+        \[
+        \Qcircuit @C=1em @R=0.7em {
+            & \qw & \gate{H} & \ctrl{1} & \ctrl{2} & \gate{R_3} & \qw & \rstick{\text{QFT output}} \\
+            & \qw & \qw      & \gate{H} & \ctrl{1} & \gate{R_2} & \qw & \rstick{\text{QFT output}} \\
+            & \qw & \qw      & \qw      & \gate{H} & \qw        & \qw & \rstick{\text{QFT output}}
+        }
+        \]
+    \end{center}
+\end{frame}
+
+% Conclusion
+\begin{frame}{Conclusion}
+    \begin{itemize}
+        \item Quantum Fourier Transform provides **exponential speedup**.
+        \item It enables key quantum algorithms like **Shor’s Algorithm** and **Quantum Phase Estimation**.
+        \item QFT is more efficient in **memory usage and circuit complexity** than classical methods.
+        \item Future quantum applications in **signal processing, AI, and cryptography** will heavily rely on QFT.
+    \end{itemize}
+\end{frame}
+
+\end{document}