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/deutsch-jozsa-algorithm/index.md | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

(limited to 'source/know/concept/deutsch-jozsa-algorithm')

diff --git a/source/know/concept/deutsch-jozsa-algorithm/index.md b/source/know/concept/deutsch-jozsa-algorithm/index.md
index 5f2f268..44b06ad 100644
--- a/source/know/concept/deutsch-jozsa-algorithm/index.md
+++ b/source/know/concept/deutsch-jozsa-algorithm/index.md
@@ -41,7 +41,8 @@ In other words, we only need to determine if $$f(0) = f(1)$$ or $$f(0) \neq f(1)
 To do this, we use the following quantum circuit,
 where $$U_f$$ is the oracle we query:
 
-{% include image.html file="deutsch-circuit.png" width="48%" alt="Deutsch circuit" %}
+{% include image.html file="deutsch-circuit.png" width="48%"
+    alt="Deutsch circuit" %}
 
 Due to unitarity constraints,
 the action of $$U_f$$ is defined to be as follows,
@@ -141,7 +142,8 @@ We are promised that $$f(x)$$ is either constant or balanced;
 other possibilities are assumed to be impossible.
 This algorithm is then implemented by the following quantum circuit:
 
-{% include image.html file="deutsch-jozsa-circuit.png" width="52%" alt="Deutsch-Jozsa circuit" %}
+{% include image.html file="deutsch-jozsa-circuit.png" width="52%"
+    alt="Deutsch-Jozsa circuit" %}
 
 There are $$N$$ qubits in initial state $$\Ket{0}$$, and one in $$\Ket{1}$$.
 For clarity, the oracle $$U_f$$ works like so:
-- 
cgit v1.2.3