diff options
Diffstat (limited to 'source/know/concept/shors-algorithm/index.md')
| -rw-r--r-- | source/know/concept/shors-algorithm/index.md | 5 |
1 files changed, 2 insertions, 3 deletions
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$$: -<a href="shors-circuit.png"> -<img src="shors-circuit.png" style="width:70%"> -</a> +{% 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/), |