It remains an open question when a commercial quantum computer will emerge that can outperform classical (non-quantum) machines in speed and energy efficiency while solving real-world combinatorial ...

The original version of this story appeared in Quanta Magazine. For computer scientists, solving problems is a bit like mountaineering. First they must choose a problem to solve—akin to identifying a ...

This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...