Quantum computing

Two researchers have proved that Penrose tilings, famous patterns that never repeat, are mathematically equivalent to a kind of quantum error correction.

From the smallest scales to the largest, the physical world provided no shortage of surprises this year.

Artificial intelligence learned how to generate text and art better than ever before, while computer scientists developed algorithms that solved long-standing problems.

What makes a quantum computer more powerful than a classical computer? It’s a surprisingly subtle question that physicists are still grappling with, decades into the quantum age.

Shor’s algorithm will enable future quantum computers to factor large numbers quickly, undermining many online security protocols. Now a researcher has shown how to do it even faster.

The Nobel Prize in Chemistry has been awarded to three researchers who harnessed the quantum behaviors of semiconductor nanocrystals.

By using “classical shadows,” ordinary computers can beat quantum computers at the tricky task of understanding quantum behaviors.

Measurement and entanglement both have a “spooky” nonlocal flavor to them. Now physicists are harnessing that nonlocality to probe the spread of quantum information and control it.

Quantum computing is still really, really hard. But the rise of a powerful class of error-correcting codes suggests that the task might be slightly more feasible than many feared.