Quantum computing

Two researchers have broken an encryption protocol that many saw as a promising defense against the power of quantum computing.

Three computer scientists have posted a proof of the NLTS conjecture, showing that systems of entangled particles can remain difficult to analyze even away from extremes.

Computer scientists have found a new type of problem that quantum computers can solve dramatically faster than their classical counterparts.

For the first time, experiments demonstrate the possibility of sharing secrets with perfect privacy — even when the devices used to share them cannot be trusted.

Two teams have shown how quantum approaches can solve problems faster than classical computers, bringing physics and computer science closer together.

For years, intermediate measurements made it hard to quantify the complexity of quantum algorithms. New work establishes that those measurements aren’t necessary after all.

A surprising new solution to Leonhard Euler’s famous “36 officers puzzle” offers a novel way of encoding quantum information.

A new result shows that quantum information can theoretically be protected from errors just as well as classical information can.

Puzzling particles, quirky (and controversial) quantum computers, and one of the most ambitious science experiments in history marked the year’s milestones.