What's up in

computational complexity

An illustration of computer scientists looking down a new road that breaks open a traveling salesperson route.
algorithms

Computer Scientists Break Traveling Salesperson Record

October 8, 2020

After 44 years, there’s finally a better way to find approximate solutions to the notoriously difficult traveling salesperson problem.

Animation showing multiple particles of light flowing together and leaving blue trails
Abstractions blog

Graced With Knowledge, Mathematicians Seek to Understand

April 8, 2020

A landmark proof in computer science has also solved an important problem called the Connes embedding conjecture. Mathematicians are working to understand it.

Animation showing toy-like depictions of computer science, quantum mechanics and pure math affecting each other.
computational complexity

Landmark Computer Science Proof Cascades Through Physics and Math

March 4, 2020

Computer scientists established a new boundary on computationally verifiable knowledge. In doing so, they solved major open problems in quantum mechanics and pure mathematics.

Art for "Computer Scientists Expand the Frontier of Verifiable Knowledge"
quantum information theory

Computer Scientists Expand the Frontier of Verifiable Knowledge

May 23, 2019

The universe of problems that a computer can check has grown. The researchers’ secret ingredient? Quantum entanglement.

Art for "Mathematicians Discover the Perfect Way to Multiply"
number theory

Mathematicians Discover the Perfect Way to Multiply

April 11, 2019

By chopping up large numbers into smaller ones, researchers have rewritten a fundamental mathematical speed limit.

Art for "In Quantum Games, There’s No Way to Play the Odds"
Abstractions blog

In Quantum Games, There’s No Way to Play the Odds

April 1, 2019

These games combine quantum entanglement, infinity and impossible-to-calculate winning probabilities. But if researchers can crack them, they’ll reveal deep mathematical secrets.

Art for "Major Quantum Computing Advance Made Obsolete by Teenager"
quantum computing

Major Quantum Computing Advance Made Obsolete by Teenager

July 31, 2018

18-year-old Ewin Tang has proven that classical computers can solve the “recommendation problem” nearly as fast as quantum computers. The result eliminates one of the best examples of quantum speedup.

Diagram showing show the hierarchy of different classes.
Abstractions blog

A Short Guide to Hard Problems

July 16, 2018

What’s easy for a computer to do, and what’s almost impossible? Those questions form the core of computational complexity. We present a map of the landscape.

Illustration for "Finally, A Problem That Only Quantum Computers Will Ever Be Able to Solve"
computational complexity

Finally, a Problem That Only Quantum Computers Will Ever Be Able to Solve

June 21, 2018

Computer scientists have been searching for years for a type of problem that a quantum computer can solve but that any possible future classical computer cannot. Now they’ve found one.