|
|
|
|
|
by okintheory
846 days ago
|
|
You should be very skeptical of all those applications except Shor. HHL: Here's a quote from Ewin Tang [1]: "We know that quantum computers can “efficiently solve” high-dimensional linear algebra problems; however, this assumes that we have some way to evolve a quantum system precisely according to input data, a much harder problem than the linear algebra itself." [1] https://ewintang.com/blog/2019/01/28/an-overview-of-quantum-... Grover's search: This is a speed-up from 2^n to 2^sqrt(n). Impressive, but there's not a lot of exp-time algorithms that people ever run. They go for heuristics instead. Quantum fourier transforms: This is a tool, it's cool, but needs an application. I haven't seen a serious proposal for using it somewhere where a classical algorithm wouldn't do better. |
|
[A] https://www.quantamagazine.org/researchers-achieve-absurdly-...