Re:Proof emerges that a quantum computer can outperform a cl...
by primaryobjects on Sunday September 29, 2019 @11:57AM
(#21107750)
The Traveling Salesman Problem is indeed a potential application of quantum computing. Grover’s Search could theoretically find a solution in quadratic time (sqrt(n!) versus n!). On a physical quantum computer, this would have profound impact to many different real-world applications.
[ Parent
| on HN ]