Electrical engineers at the Tokyo University of Science have created a CMOS chip that implements a quantum annealing processor capable of solving the traveling salesman problem for 22 cities in a second. According to the researchers, a conventional 30Goperation/s, high-performance von Neumann architecture CPU that can solve a 16 city travelling salesman problem in 12 minutes, would require about ...

This story continues at More on: CMOS quantum chip solves ‘travelling salesman’ problem for 22 cities

Or just read more coverage at Electronics Weekly