Who is the market leader now? Is it D-Wave or IBM? Someone else?!
And even these algorithms can help asymptotic complexity, but not solve an NP complete problem in polynomial time.
(Even AES256 is pretty much safe against a quantum attack, since a quantum computer effectively square roots the time complexity, and that just leaves key-exchange protocols, of which several QR-variants exist.)
Personally, I think the hype far outweighs the value, even compared to Big Data/IoT.
Is this a theorem or conjecture?
IE, I was talking about quantum algorithms we have, none of which have done so, not stating the impossibility of such an algorithm.
I am not aware of a proof that comments on whether or not such an algorithm is impossible, however.