Why do I feel oddly satisfied by this news? https://www.quantamagazine.org/teenager-finds-classical-alternative-to-quantum-recommendation-algorithm-20180731/ … (cc @skdh )
If we find a polynomial time algorithm for a problem that was supposed to be in BQP, it does not follow that quantum computers cannot perform faster than classical computers. Only that this particular problem ceases to be a touchstone.
-
-
Fair enough. It doesn't invalidate quantum computing in its entirety. It's an incremental step in weakening the original argument since this case was "one of the best examples".
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.