[primaryobjects]

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.

[teraflop]

Grover's algorithm provides a quadratic speedup, but sqrt(n!) is not quadratic time; it's super-exponential.