Plate Nº 49 · recorded October 13, 2026

PhysicsReported finding

Quantum 'dark horse' anyons hit universal computing milestone

Physicists built the first universal quantum gate set from non-Abelian anyons on 54 qubits of Quantinuum's H2 processor, a Nature paper reports. The method could bypass costly magic state distillation in future fault-tolerant systems.

By Elena Vasquez4 min read755 words

In brief

  1. First universal gate set from non-Abelian anyons demonstrated on September 25, 2026 in Nature
  2. Experiment used 54 entangled qubits on Quantinuum's H2 trapped-ion processor
  3. Researchers used S3 symmetry (equilateral triangle) instead of the 2024 D4 (square) attempt
  4. Combined braiding and fusion to produce one entangling gate and two measurement operations
  5. Theoretical basis dates to Carlos Mochon's 2003 Caltech PhD thesis under John Preskill

A team of physicists has produced the first experimental proof that exotic objects called non-Abelian anyons can run every operation a universal quantum computer needs. The result appears in Nature on September 25, 2026.

What did the team actually show?

They built a complete gate set, the basic toolbox a quantum computer uses to manipulate information. "We demonstrated a so-called universal gate set — meaning that if you store information in these emergent versions of quarks, and you move them around, you can do any quantum computation you might want to do," said Ruben Verresen, assistant professor of molecular engineering at UChicago PME and a co-author of the new study.

The experiment used 54 entangled qubits on Quantinuum's H2 trapped-ion processor. Three operations mattered:

  • One entangling gate produced by braiding
  • Two measurement operations produced by fusing anyons together

Combined, those three pieces can in principle generate any quantum operation. The team also produced a magic state directly, without the costly distillation step most quantum systems need.

The key takeaway: braiding plus fusion together unlock what braiding alone never could.

Why does error correction matter here?

Quantum computers drop bits constantly. Today's best defense spreads each unit of information across many physical qubits, then watches for mistakes. That shielding works, but it does not by itself handle every computational step.

For the steps it cannot handle, engineers lean on "magic states" — specially prepared resources that fill the gap. Producing them usually means running an intensive purification called distillation, which chews through huge numbers of qubits.

"Non-Abelian codes are a dark horse in the race to quantum error correction," said Henrik Dreyer, managing director and scientific lead at Quantinuum's Munich office and a co-author. "In this work we show the first universal gate set in a non-Abelian code, which demonstrates that fault-tolerant computations can in principle be done without resorting to magic state distillation or cultivation, which are the most expensive operations in standard quantum error correction codes."

Bottom line: anyon-based codes could slash one of quantum computing's biggest overheads.

How are these anyons different from ordinary qubits?

A normal qubit stores information in two basic states, plus quantum mixtures of them. Non-Abelian anyons don't exist as ordinary particles. Engineers build them inside quantum circuits by entangling many qubits into a single collective state that behaves like a brand-new particle with its own unusual rules.

"The way I think about these codes is they're creating little universes — alternative universes, but ones that reflect some of the properties of our own," Verresen said.

Each anyon carries an internal state that changes when one anyon loops around another, a move called braiding. The order of those loops matters, hence the name "non-Abelian." Because information lives spread across many entangled qubits, it gains some natural defense against small disturbances.

The upshot: a single hardware trick delivers both computation and a layer of protection.

Why wasn't braiding alone enough?

In 2024, a team that included Verresen created anyons tied to a symmetry group called D4 — the rotations and reflections that leave a square unchanged. They proved the particles existed and could be moved around. They also hit a wall.

"In that work, we didn't demonstrate that those emergent forces were enough to do quantum computation," Verresen said. "That particular universe we created was not powerful enough."

For the new study, the team switched to S3, the symmetry of an equilateral triangle, and built the matching anyons on the H2 processor. S3 brings enough structure for universal computation, but only if braiding teams with a second move: fusion, bringing two anyons together and measuring the result.

The deeper idea dates to 2003, when Carlos Mochon proposed it in his Caltech PhD thesis under John Preskill. Two decades of theory and hardware progress turned that math into a working experiment.

What's next?

The latest run skipped active error correction. The team focused on confirming each building block worked and that the magic state matched theory. "So far, we've ignored the question of error correction. Here, it's more like a proof of principle," Verresen said.

Next stop: weave these operations into a full fault-tolerant setup. Verresen is already collaborating with PME colleagues on ways to stabilize non-Abelian quantum memories.

The takeaway: the method works on paper and on hardware, but the road to a large-scale fault-tolerant machine still runs through the unglamorous work of stitching every piece together.

via pme.uchicago.edu (Original)

Filed under

  • quantum-computing
  • anyons
  • qubits
  • error-correction
  • trapped-ions
Share this article:

More from Elena Vasquez

Elena Vasquez

Show full bio

Correspondent covering money, funding and market shifts around general science news at SciBeat.

228 articles

Nearby plates

« Previous articleNext article »