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/shors-algorithm/index.md | 5 ++--- source/know/concept/shors-algorithm/shors-circuit.avif | Bin 0 -> 6076 bytes 2 files changed, 2 insertions(+), 3 deletions(-) create mode 100644 source/know/concept/shors-algorithm/shors-circuit.avif (limited to 'source/know/concept/shors-algorithm') diff --git a/source/know/concept/shors-algorithm/index.md b/source/know/concept/shors-algorithm/index.md index 0241f9f..a47151a 100644 --- a/source/know/concept/shors-algorithm/index.md +++ b/source/know/concept/shors-algorithm/index.md @@ -30,6 +30,7 @@ With minimal modifications, Shor's algorithm can solve practically every such problem. + ## Integer factorization Originally, Shor's algorithm was designed to factorize an integer $$N$$, @@ -46,9 +47,7 @@ The period $$s$$ is the smallest integer satisfying $$f(x) = f(x+s)$$. To do this, the following $$2q$$-qubit quantum circuit is used, with $$q$$ chosen so that $$N^2 \le 2^q < 2 N^2$$: - - - +{% include image.html file="shors-circuit.png" width="70%" alt="Shor's circuit" %} Here, $$\mathrm{QFT}_q$$ refers to the $$q$$-qubit [quantum Fourier transform](/know/concept/quantum-fourier-transform/), diff --git a/source/know/concept/shors-algorithm/shors-circuit.avif b/source/know/concept/shors-algorithm/shors-circuit.avif new file mode 100644 index 0000000..94b3925 Binary files /dev/null and b/source/know/concept/shors-algorithm/shors-circuit.avif differ -- cgit v1.2.3