News for hackers. Stuff that matters.
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.
Re:Proof emerges that a quantum computer can outperform a cl... by teraflop on Sunday September 29, 2019 @12:09PM (#21107838)
Grover's algorithm provides a quadratic speedup, but sqrt(n!) is not quadratic time; it's super-exponential.