I was reading the Quanta article here which shows that there exists a problem which achieves "oracle separation between BQP and PH". In simple terms, there exists a problem which a quantum computer can solve with far fewer calls to an oracle than a classical computer could (even in the realm where P=NP).
Why is this a stronger result than the well-known Deutsch-Jozsa algorithm to decide if a function is constant or balanced? In that case too, a classical computer had to make $O(n)$ calls to an oracle (the function) while a quantum computer could do so with a single query. Does this not prove that quantum computers are distinct from any possible classical computer, even if P=NP?