Lecture 9. Quantum algorithms with black boxes

We have discussed the phenomenon of computation with black boxes and defined the use of oracles in the quantum case. Due to the use of entanglement it is possible to solve some problems for less number of oracle calls than in the classical case. We have analysed the Deutsch-Jozsa, Bernstein-Vazirani and Simon algorithms, which clearly show this improvement.