The first quantum algorithm we will look at is the Bernstein-Vazirani algorithm.

Given a secret s $\in \{0,1\}^n$ and the function f : $\{0,1\}^n \rightarrow \{0,1\}$ defined as f(x) = x * s
\* denotes the inner product of two bitstrings here
For Bitstrings x and y of length n the inner product x * y is