Finding a Hidden String
Classical computers find a hidden bitstring in $O(n)$ steps. Bernstein-Vazirani finds it in exactly 1 step, regardless of how long the string is.
Bernstein-Vazirani Algorithm
Quantum Computing Basics for Developers
Quantum Computing Basics for Developers
Classical computers find a hidden bitstring in $O(n)$ steps. Bernstein-Vazirani finds it in exactly 1 step, regardless of how long the string is.