The quantum complexity world is a rocking with the paper released yesterday by Ran Raz and Avishay Tal, Oracle Separation of BQP and PH, resolving a question open since quantum complexity got its start over two decades ago. Scott Aaronson had a whole survey on this question. All of you readers should be familiar with the P v NP question. P is the set of problems efficiently solvable