What's up in
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.
Mathematicians and computer scientists made big progress in number theory, graph theory, machine learning and quantum computing, even as they reexamined our fundamental understanding of mathematics and neural networks.
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 finally seem to have a quantum computer that can outperform a classical computer. But what does that really mean?
Fifty years after the current internet was born, the physicist and computer scientist Stephanie Wehner is planning and designing the next internet — a quantum one.
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.
Neven’s law states that quantum computers are improving at a “doubly exponential” rate. If it holds, quantum supremacy is around the corner.