What's up in
After 44 years, there’s finally a better way to find approximate solutions to the notoriously difficult traveling salesperson problem.
A landmark proof in computer science has also solved an important problem called the Connes embedding conjecture. Mathematicians are working to understand it.
Computer scientists established a new boundary on computationally verifiable knowledge. In doing so, they solved major open problems in quantum mechanics and pure mathematics.
The universe of problems that a computer can check has grown. The researchers’ secret ingredient? Quantum entanglement.
By chopping up large numbers into smaller ones, researchers have rewritten a fundamental mathematical speed limit.
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.
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.