Quantum Computing
The article argues that trading workflows lack the NP-hard problems where quantum speedups would be category-changing. Current quantum machine learning has not shown the kind of decisive advantage that Shor's algorithm shows in cryptograph…
1 sources - 4 claims
The article argues that trading workflows lack the NP-hard problems where quantum speedups would be category-changing. Current quantum machine learning has not shown the kind of decisive advantage that Shor's algorithm shows in cryptography. Shor's algorithm is presented as a genuine quantum step-change because it can factor large integers in polynomial time. The article says quantum computational advantages come from quantum entanglement.