|
|
|
|
|
|
by zachf
901 days ago
|
|
|
Most quantum computer experts think that this is not the case, that it is very unlikely that quantum computers can solve NP-complete problems like travelling salesman more efficiently than classical computers. (In particular, the popular intuition that quantum computers “try a lot of solutions in parallel” is basically totally wrong, at least from the perspective of making a useful heuristic for what quantum computers are good for.) This is an older article, but its conclusions are still about right: https://www.cs.virginia.edu/~robins/The_Limits_of_Quantum_Co... |
|
|