Re: What sort of problem *is* this machine designed to solve?
> Optimisation of fuel tankers. A machine like this would be able to simulate the movement of all tankers over all routes between depots and find the lowest cost solution in terms of either time or fuel consumed.
That's the travelling salesman problem.
But how does a quantum computer compare all possible outcomes and collapse to the "best" one? That's not the same as collapsing to the right answer when all the others are wrong.
Biting the hand that feeds IT
