From b1a9b1b9b2f04efd6dc39bd2a02c544d34d1259c Mon Sep 17 00:00:00 2001
From: Prefetch
Date: Sun, 1 Jan 2023 16:40:56 +0100
Subject: Change license, add Makefile, add image caching control

---
 source/know/concept/quantum-fourier-transform/index.md | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

(limited to 'source/know/concept/quantum-fourier-transform/index.md')

diff --git a/source/know/concept/quantum-fourier-transform/index.md b/source/know/concept/quantum-fourier-transform/index.md
index 1c68ad0..217596b 100644
--- a/source/know/concept/quantum-fourier-transform/index.md
+++ b/source/know/concept/quantum-fourier-transform/index.md
@@ -172,13 +172,15 @@ The quantum circuit to execute the mentioned steps is illustrated below,
 excluding the swapping part to get the right order.
 Here, $$R_m$$ means $$R_\phi$$ with $$\phi = 2 \pi / 2^m$$:
 
-{% include image.html file="qft-circuit-noswap.png" width="100%" alt="QFT circuit, without final swap" %}
+{% include image.html file="qft-circuit-noswap.png" width="100%"
+    alt="QFT circuit, without final swap" %}
 
 Again, note how the inputs $$\Ket{x_j}$$ and outputs $$\Ket{k_j}$$ are in the opposite order.
 The complete circuit, including the swapping at the end,
 therefore looks like this:
 
-{% include image.html file="qft-circuit-swap.png" width="85%" alt="QFT circuit, including final swap" %}
+{% include image.html file="qft-circuit-swap.png" width="85%"
+    alt="QFT circuit, including final swap" %}
 
 For each of the $$n$$ qubits, $$\mathcal{O}(n)$$ gates are applied,
 so overall the QFT algorithm is $$\mathcal{O}(n^2)$$.
-- 
cgit v1.2.3