Computational complexity

One computer scientist’s “stunning” proof is the first progress in 50 years on one of the most famous questions in computer science.

When pigeons outnumber pigeonholes, some birds must double up. This obvious statement — and its inverse — have deep connections to many areas of math and computer science.

Despite the hype, it’s been surprisingly challenging to find quantum algorithms that outperform classical ones. In this episode, Ewin Tang discusses her pioneering work in “dequantizing” quantum algorithms — and what it means for the future of quantum computing.

It’s been difficult to find important questions that quantum computers can answer faster than classical machines, but a new algorithm appears to do it for some critical optimization tasks.

Ten years ago, researchers proved that adding full memory can theoretically aid computation. They’re just now beginning to understand the implications.

Recent results show that large language models struggle with compositional tasks, suggesting a hard limit to their abilities.

Hypothetical devices that can quickly and accurately answer questions have become a powerful tool in computational complexity theory.

Three researchers have figured out how to craft a proof that spreads out information while keeping it perfectly secret.

Cryptography is the thread that connects Julius Caesar, World War II and quantum computing, and it now lies under nearly every part of modern life. In this week’s episode, computer scientist Boaz Barak and co-host Janna Levin discuss the past and future of secrecy.