The goal of a combinatorial optimization problem is to find the best ordering of a set of discrete items. A classic combinatorial optimization challenge is the Traveling Salesman Problem (TSP). The ...

Dr. James McCaffrey of Microsoft Research explains a new idea that slightly modifies standard simulated annealing by borrowing ideas from quantum mechanics. The goal of a combinatorial optimization ...

NEC Corporation has announced the launch of the “NEC Vector Annealing Service,” a quantum-inspired simulated annealing service that uses a vector supercomputer, as well as the launch of educational ...

Before we had developed the first qubit, theoreticians had done the work that showed that a sufficiently powerful gate-based quantum computer would be able to perform calculations that could not ...

Ars Technica has been separating the signal from the noise for over 25 years. With our unique combination of technical savvy and wide-ranging interest in the technological arts and sciences, Ars is ...