What's up in
Digital security depends on the difficulty of factoring large numbers. A new proof shows why one method for breaking digital encryption won’t work.
Urmila Mahadev spent eight years in graduate school solving one of the most basic questions in quantum computation: How do you know whether a quantum computer has done anything quantum at all?
A visual prank exposes an Achilles’ heel of computer vision systems: Unlike humans, they can’t do a double take.
The nearest neighbor problem asks where a new point fits into an existing data set. A few researchers set out to prove that there was no universal way to solve it. Instead, they found such a way.
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.