On: P vs. NP and the Computational Complexity Zoo (2014) [video]

[eru]

And almost certainly, NP \not \subset BQP. In fact, there are only a few problems found so far where quantum computing gives a speedup compared to classical computers.