What's the chance someone will come along with a classical analog that matches/beats this result? I remember seeing claims of quantum supremacy in the past and then clever people invented new classical algorithms that performed just as well.
However, on the extreme end, proving that quantum and classical computers are equivalent, would be probably more surprising than proving P=NP.