The traveling salesman problem is considered a prime example of a combinatorial optimization problem. Now a Berlin team led by theoretical physicist Prof. Dr. Jens Eisert of Freie Universität Berlin ...

CAMBRIDGE, U.K. – A small Microsoft Research team had lofty goals when it set out four years ago to create an analog optical computer that would use light as a medium for solving complex problems.

It’s been difficult to find important questions that quantum computers can answer faster than classical machines, but a new algorithm appears to do it for some critical optimization tasks. For ...