diff options
author | Prefetch | 2023-01-01 16:40:56 +0100 |
---|---|---|
committer | Prefetch | 2023-01-01 17:02:29 +0100 |
commit | b1a9b1b9b2f04efd6dc39bd2a02c544d34d1259c (patch) | |
tree | 1fd87919deee17e58f8ad19c09abd54bd4a70886 /source/know/concept/quantum-fourier-transform | |
parent | 1d700ab734aa9b6711eb31796beb25cb7659d8e0 (diff) |
Change license, add Makefile, add image caching control
Diffstat (limited to 'source/know/concept/quantum-fourier-transform')
-rw-r--r-- | source/know/concept/quantum-fourier-transform/index.md | 6 |
1 files changed, 4 insertions, 2 deletions
diff --git a/source/know/concept/quantum-fourier-transform/index.md b/source/know/concept/quantum-fourier-transform/index.md index 1c68ad0..217596b 100644 --- a/source/know/concept/quantum-fourier-transform/index.md +++ b/source/know/concept/quantum-fourier-transform/index.md @@ -172,13 +172,15 @@ The quantum circuit to execute the mentioned steps is illustrated below, excluding the swapping part to get the right order. Here, $$R_m$$ means $$R_\phi$$ with $$\phi = 2 \pi / 2^m$$: -{% include image.html file="qft-circuit-noswap.png" width="100%" alt="QFT circuit, without final swap" %} +{% include image.html file="qft-circuit-noswap.png" width="100%" + alt="QFT circuit, without final swap" %} Again, note how the inputs $$\Ket{x_j}$$ and outputs $$\Ket{k_j}$$ are in the opposite order. The complete circuit, including the swapping at the end, therefore looks like this: -{% include image.html file="qft-circuit-swap.png" width="85%" alt="QFT circuit, including final swap" %} +{% include image.html file="qft-circuit-swap.png" width="85%" + alt="QFT circuit, including final swap" %} For each of the $$n$$ qubits, $$\mathcal{O}(n)$$ gates are applied, so overall the QFT algorithm is $$\mathcal{O}(n^2)$$. |