What's up in
New Codes Could Make Quantum Computing 10 Times More Efficient
Quantum computing is still really, really hard. But the rise of a powerful class of error-correcting codes suggests that the task might be slightly more feasible than many feared.
Complexity Theory’s 50-Year Journey to the Limits of Knowledge
How hard is it to prove that problems are hard to solve? Meta-complexity theorists have been asking questions like this for decades. A string of recent results has started to deliver answers.
Risky Giant Steps Can Solve Optimization Problems Faster
New results break with decades of conventional wisdom for the gradient descent algorithm.
The Cryptographer Who Ensures We Can Trust Our Computers
Yael Tauman Kalai’s breakthroughs secure our digital world, from cloud computing to our quantum future.
To Move Fast, Quantum Maze Solvers Must Forget the Past
Quantum algorithms can find their way out of mazes exponentially faster than classical ones, at the cost of forgetting the path they took. A new result suggests that the trade-off may be inevitable.
Computer Scientists Inch Closer to Major Algorithmic Goal
A new paper finds a faster method for determining when two mathematical groups are the same.