summaryrefslogtreecommitdiff
path: root/source/know/concept/simons-algorithm
diff options
context:
space:
mode:
Diffstat (limited to 'source/know/concept/simons-algorithm')
-rw-r--r--source/know/concept/simons-algorithm/index.md5
-rw-r--r--source/know/concept/simons-algorithm/simons-circuit.avifbin0 -> 4866 bytes
2 files changed, 1 insertions, 4 deletions
diff --git a/source/know/concept/simons-algorithm/index.md b/source/know/concept/simons-algorithm/index.md
index 5502837..294912b 100644
--- a/source/know/concept/simons-algorithm/index.md
+++ b/source/know/concept/simons-algorithm/index.md
@@ -52,9 +52,7 @@ A quantum computer needs to query $$f$$ only $$\mathcal{O}(n)$$ times,
although the exact number varies due to the algorithm's probabilistic nature.
It uses the following circuit:
-<a href="simons-circuit.png">
-<img src="simons-circuit.png" style="width:52%">
-</a>
+{% include image.html file="simons-circuit.png" width="52%" alt="Simon's circuit" %}
The XOR oracle $$U_f$$ implements $$f$$,
and has the following action for $$n$$-bit $$a$$ and $$b$$:
@@ -98,7 +96,6 @@ $$\begin{aligned}
&\frac{1}{2^n} \sum_{x = 0}^{2^n - 1} \bigg( \sum_{y = 0}^{2^n - 1} (-1)^{x \cdot y} \Ket{y} \bigg) \Ket{f(x)}
\end{aligned}$$
-
Next, we measure all qubits.
The order in which we do this does not matter,
but, for clarity, let us measure the last $$n$$ qubits first,
diff --git a/source/know/concept/simons-algorithm/simons-circuit.avif b/source/know/concept/simons-algorithm/simons-circuit.avif
new file mode 100644
index 0000000..f7d701a
--- /dev/null
+++ b/source/know/concept/simons-algorithm/simons-circuit.avif
Binary files differ