Hmmm. I'm no mathematician; but I thought the value of an "exponential speedup" is if you are trying to solve a problem with "exponential complexity".
I don't know if "exponential compexity" is a thing; I'm pretty sure "exponential speedup" isn't. Is it correct to say that a quantum factoring machine has an "exponential speedup"? Isn't it more accurate to say that the exponential difficulty is a property of the classical algorithms, not of the problem itself?