Tokyo University of Science researchers have built a chip-based quantum annealing processor that can solve the classically thorny ‘travelling salesman’ mathematical puzzle, which gets far more complex every time a new city is added, for up to 22 cities. According to the university, this is “something that would take about 1,200 years for a high-performance von ...

This story continues at Quantum chip solves ‘travelling salesman’ problem for 22 cities

Or just read more coverage at Electronics Weekly