Quantinuum & UChicago PME Demonstrate Universal Quantum Gates Using Anyons

Understand this faster with AI
Researchers from Quantinuum and the University of Chicago Pritzker School of Molecular Engineering have demonstrated a complete set of operations for universal quantum computation using non-Abelian anyons, exotic quantum particles offering a different approach to building versatile quantum computers.
The team reports demonstrating a universal gate set, meaning that information stored in these particles and manipulated through a process called braiding could theoretically perform any quantum computation. This proof-of-concept moves beyond theoretical possibility, potentially offering a path to more reliable quantum processing by avoiding the resource-intensive magic state distillation currently required for error correction. “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, adding that this work shows fault-tolerant computations may be possible without this costly process. Non-Abelian Anyons Encode Qutrits for Universal Computation Researchers are leveraging the unusual properties of non-Abelian anyons to construct quantum computers capable of surpassing the limitations of traditional qubit systems. “We demonstrated a universal gate set—meaning that if you store information in these particles, and you move them around, you can do any quantum computation you might want to do,” explained Ruben Verresen, assistant professor of molecular engineering at UChicago PME and a co-author of the study published in Nature on July 15, 2026. Unlike standard qubits which rely on binary states, this approach utilizes encoding topological qutrits which have three levels of quantum information, a significant increase in computational capacity.
The team entangled 54 qubits on Quantinuum’s H2 trapped-ion processor, building anyons based on an S3 symmetry group, and pairing braiding with a process called fusion, where two anyons merge and the outcome is measured. This combination proved crucial; earlier work with D4 symmetry, while marking the first demonstration of this kind of non-Abelian order on quantum hardware, lacked the necessary power for complete quantum computation. The researchers showed that these anyons could directly prepare a magic state, a critical component for error correction, bypassing the resource-intensive process common in other quantum computing architectures. This avoidance of distillation is particularly significant because it could dramatically reduce the number of qubits needed for a functional, error-corrected machine. 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. Ruben Verresen, assistant professor of molecular engineering at UChicago PME D4 Symmetry Limitations & Transition to S3 for Braiding Initial demonstrations of non-Abelian anyon-based quantum computation relied on a symmetry group known as D4, mirroring the symmetries of a square, but researchers quickly discovered limitations in its computational power. The 2024 work from Verresen’s team marked the first demonstration of this kind of non-Abelian order on quantum hardware using Quantinuum’s trapped-ion computer, but braiding alone proved insufficient to achieve a complete set of quantum operations. “In that work, we didn’t demonstrate that those particles were enough to do quantum computation,” explained Verresen, highlighting the need for a more versatile system. The D4 symmetry, despite representing a significant first step, lacked the necessary properties for universal computation; the resulting system created by these anyons simply wasn’t powerful enough to execute all possible quantum algorithms. To overcome this hurdle, the team shifted their focus to S3 symmetry, the rotational and reflective symmetries of an equilateral triangle, and implemented it on Quantinuum’s H2 trapped-ion processor, entangling 54 qubits. This concept, initially proposed theoretically in 2003 by Carlos Mochon while at Caltech, required substantial development to translate into a practical protocol for quantum hardware. The researchers encoded topological qutrits which have three levels of quantum information compared with the two levels encoded by standard qubits, and demonstrated three operations, braiding for entanglement, and two distinct measurements from fusion, capable of performing any quantum operation. 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. Researchers successfully demonstrated a complete toolkit of quantum operations using these anyons, a significant step toward building a truly general-purpose quantum computer. This work builds on earlier research, including a 2024 demonstration that marked the first demonstration of this kind of non-Abelian order on quantum hardware, but crucially expands the computational possibilities. The current breakthrough leverages S3 symmetry, enabling a combination of braiding, moving anyons around each other, and fusion, to achieve a result. Notably, this approach offers a potential pathway to avoid the resource-intensive processes currently required for error correction. The researchers demonstrated the ability to prepare a magic state directly through topological operations, potentially saving a substantial number of qubits. While active error correction wasn’t implemented in this study, the team verified the creation of a theoretically predicted magic state. In that work, we didn’t demonstrate that those emergent forces were enough to do quantum computation. Ruben Verresen, assistant professor of molecular engineering at UChicago PME The pursuit of reliable quantum computation received a significant boost as researchers demonstrated a pathway to bypass a major obstacle: magic state distillation. This resource-intensive process, essential for error correction in many quantum computer designs, consumes a substantial portion of available qubits. So far, we’ve ignored the question of error correction. Here, it’s more like a proof of principle. Ruben Verresen, assistant professor of molecular engineering at UChicago PME Source: https://pme.uchicago.edu/news-events/news/braided-exotic-particles-could-build-reliable-universal-quantum-computers Stay currentSee today’s quantum computing news on Quantum Zeitgeist for the latest breakthroughs in qubits, hardware, algorithms, and industry deals. Tags:
Tags
Source Information
Discussion
0 professional contributions
Sign in to join this professional discussion.
Be the first to add a constructive contribution.
