Complexity theory is a fundamental branch of theoretical computer science that categorises computational problems according to their inherent difficulty and the resources required to solve them. At ...

Right now, quantum computers are small and error-prone compared to where they’ll likely be in a few years. Even within those limitations, however, there have been regular claims that the hardware can ...

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 ...

Those that solve artificially simplified problems where quantum advantage is meaningless. Those that provide no genuine quantum advantage when all costs are properly accounted for. This critique is ...

A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...

The original version of this story appeared in Quanta Magazine. If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle ...