From bcae81336764eb6c4cdf0f91e2fe632b625dd8b2 Mon Sep 17 00:00:00 2001 From: Prefetch Date: Sun, 23 Oct 2022 22:18:11 +0200 Subject: Optimize and improve naming of all images in knowledge base --- source/know/concept/simons-algorithm/index.md | 5 +---- source/know/concept/simons-algorithm/simons-circuit.avif | Bin 0 -> 4866 bytes 2 files changed, 1 insertion(+), 4 deletions(-) create mode 100644 source/know/concept/simons-algorithm/simons-circuit.avif (limited to 'source/know/concept/simons-algorithm') 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: - - - +{% 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 Binary files /dev/null and b/source/know/concept/simons-algorithm/simons-circuit.avif differ -- cgit v1.2.3