What's up in

quantum computing

quantum information theory

How to Turn a Quantum Computer Into the Ultimate Randomness Generator

Pure, verifiable randomness is hard to come by. Two proposals show how to make quantum computers into randomness factories.

Photo of a silver metal plate with chips mounted on its surface.
Abstractions blog

A New Law to Describe Quantum Computing’s Rise?

Neven’s law states that quantum computers are improving at a “doubly exponential” rate. If it holds, quantum supremacy is around the corner.

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

Computer Scientists Expand the Frontier of Verifiable Knowledge

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

Art for "A New Approach to Multiplication Opens the Door to Better Quantum Computers"
Abstractions blog

A New Approach to Multiplication Opens the Door to Better Quantum Computers

Quantum computers can’t selectively forget information. A new algorithm for multiplication shows a way around that problem.

quantum physics

Quantum Machine Appears to Defy Universe’s Push for Disorder

One of the first quantum simulators has produced a puzzling phenomenon: a row of atoms that repeatedly pops back into place.

Art for "How Space and Time Could Be a Quantum Error-Correcting Code"
space-time

How Space and Time Could Be a Quantum Error-Correcting Code

The same codes needed to thwart errors in quantum computers may also give the fabric of space-time its intrinsic robustness.

Art for "Milestone Experiment Proves Quantum Communication Really Is Faster"
quantum computing

Milestone Experiment Proves Quantum Communication Really Is Faster

In a Paris lab, researchers have shown for the first time that quantum methods of transmitting information are superior to classical ones.

Photo of Urmila Mahadev
quantum computing

Graduate Student Solves Quantum Verification Problem

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?

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

Major Quantum Computing Advance Made Obsolete by Teenager

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.