I'm trying to wrap my head around Simon's Algorithm (the quantum computing one), and all I can find on the internet is the formal defition: nobody actually ever does it with real input. However, I do need to be able to do this for my course, so I'd be very happy if someone could walk me through an example.
This is the input I've been given:
Let $F : \{0,1\}^2 \to \{0,1\}^2$ be defined as follows:
$f(00) = f(01) = 00$ $f(10) = f(11) = 01$
Apply Simon's algorithm to determine a linear dependency for the digits of $s = 01$. (Give a possible scenario).
Now I've gotten this far:
Start out with $|0^n0^n\rangle$ with $n = 2$. So, $|0000\rangle$.
Then, apply Hadamards to the first $n$ bits: $(1/\sqrt{4})(|0000\rangle + |0100\rangle + |1000\rangle + |1100\rangle)$
Then, apply $f$: $(1/\sqrt{4})(|0001\rangle + |0100\rangle + |1011\rangle + |1110\rangle)$
Now, I have to apply Hadamards to the first $n$ bits again, but I'm not quite sure how to continue...
If anyone could help me, I'd be really grateful!
Linus