diff options
| author | Prefetch | 2024-07-17 10:01:43 +0200 |
|---|---|---|
| committer | Prefetch | 2024-07-17 10:01:43 +0200 |
| commit | 075683cdf4588fe16f41d9f7b46b9720b42b2553 (patch) | |
| tree | f200b341b35e9c89aa1030a2f6da94cd0e1e958b /source/know/concept/bernstein-vazirani-algorithm | |
| parent | c4d597e8d695eb145755464cffbf88a68fd0c88a (diff) | |
Improve knowledge base
Diffstat (limited to 'source/know/concept/bernstein-vazirani-algorithm')
| -rw-r--r-- | source/know/concept/bernstein-vazirani-algorithm/index.md | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/source/know/concept/bernstein-vazirani-algorithm/index.md b/source/know/concept/bernstein-vazirani-algorithm/index.md index 884cca3..4f36d3c 100644 --- a/source/know/concept/bernstein-vazirani-algorithm/index.md +++ b/source/know/concept/bernstein-vazirani-algorithm/index.md @@ -24,8 +24,8 @@ of $$x$$ with an unknown $$N$$-bit string $$s$$: $$\begin{aligned} f(x) - = s \cdot x \:\:(\bmod \: 2) - = (s_1 x_1 + s_2 x_2 + \:...\: + s_N x_N) \:\:(\bmod \: 2) + \equiv s \cdot x \:\bmod 2 + = (s_1 x_1 + s_2 x_2 + \:...\: + s_N x_N) \:\bmod 2 \end{aligned}$$ The goal is to find $$s$$. |