[okintheory]

Also, just to add, 'quantumalgorithmszoo.org' is quite out of date: For example, they claim a polynomial speed-up for network flow, but that's based on the SOTA in 2007. These days, there's an almost-linear time classical algorithm [A], and no matching quantum algorithm (and also the idea that you would want to use a quantum computer to shave a factor n^(0.0001) is ridiculous). Now, all these statements are only about asymptotics, but don't get me started on practicalities: The idea that in the next 50 years you would use a quantum computer for any problem with only a polynomial speed-up is silly.

[A] https://www.quantamagazine.org/researchers-achieve-absurdly-...