Error correction

In the search for the most scalable hardware to use for quantum computers, qubits made of individual atoms are having a breakout moment.

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

Integer linear programming can help find the answer to a variety of real-world problems. Now researchers have found a much faster way to do it.

Locally correctable codes need barely any information to fix errors, but they’re extremely long. Now we know that the simplest versions can’t get any shorter.

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.

A simple geometric idea has been used to power advances in information theory, cryptography and even blockchain technology.

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

By carefully constructing a multidimensional and well-connected graph, a team of researchers has finally created a long-sought locally testable code that can immediately betray whether it’s been corrupted.

Quantum bits are fussy and fragile. Useful quantum computers will need to use an error-correction technique like the one that was recently demonstrated on a real machine.