What's up in
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.
A curious physicist has discovered an unexpected link between theoretical block collisions and a famed quantum search algorithm.
Today Google announced that it achieved “quantum supremacy.” Its chief quantum computing rival, IBM, said it hasn’t. The disagreement hinges on what the term really means.
Researchers are getting close to building a quantum computer that can perform tasks a classical computer can’t. Here’s what the milestone will mean.
Pure, verifiable randomness is hard to come by. Two proposals show how to make quantum computers into randomness factories.