diff options
Diffstat (limited to 'source/know/concept/quantum-fourier-transform/index.md')
| -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)$$. |