The work brings together teams from the University of Chicago Pritzker School of Molecular Engineering, Harvard, Stony Brook University, and Quantinuum. Using non-Abelian anyons encoded across multiple qubits, the researchers show that by moving (braiding) these excitations in carefully chosen patterns—and combining that with additional operations—they can implement the full range of gates needed for arbitrary quantum algorithms.

“We demonstrated a universal gate set,” said Ruben Verresen of UChicago PME, explaining that storing information in these emergent quark-like degrees of freedom and then manipulating them enables essentially any quantum computation. The goal is not just proof that quantum effects can be controlled, but that the control is broad enough to scale into general-purpose computing.

A central motivation is fault tolerance. Conventional quantum error correction protects qubits by spreading information across many physical qubits, but universal gate sets usually require resource-heavy “magic states.” Building those states typically involves distillation procedures that consume significant machine time and qubits—one of the biggest practical costs in leading architectures.

Non-Abelian anyons are naturally attractive because their information is distributed across entangled degrees of freedom, making them comparatively resilient to local noise. Just as importantly, their braiding can function as computation. Yet prior demonstrations using the D4 symmetry group—based on rotations and reflections of a square—showed that braiding alone was not enough to reach full universality.

The new study targets a different symmetry, S3, associated with rotations and mirror flips of an equilateral triangle. On Quantinuum’s H2 trapped-ion processor, the team entangled 54 qubits to realize S3-based anyons. Crucially, the researchers show that universality emerges only when braiding is paired with fusion, a measurement-like operation where two anyons are merged and the outcome is read out.

To benchmark the approach, the team encoded information in “topological qutrits,” which use three quantum levels rather than the two levels of ordinary qubits. Braiding produced an entangling operation, while fusion generated distinct measurement operations; together, these components can in principle synthesize any quantum transformation, including gates unreachable by braiding alone. The protocol also enables preparation of a magic state directly via topological operations, potentially avoiding expensive distillation.

In the current results, the researchers did not perform active error correction. Instead, they verified key building blocks and confirmed that a magic state produced through anyon-based procedures matches theoretical expectations. “So far, we’ve ignored the question of error correction,” Verresen said—framing the work as a proof of principle.

The next step is to integrate this anyon-based approach with error correction to move from demonstrated primitives to scalable, fault-tolerant computation. Verresen and collaborators are already exploring methods to stabilize non-Abelian quantum memories, aiming to make this “dark horse” architecture practical for large-scale quantum machines.

Subject of Research: Universal quantum computation with non-Abelian anyons (braiding and fusion) and implications for fault-tolerant quantum error correction
Article Title: Universal gates from braiding and fusing anyons on quantum hardware
News Publication Date: 15-Jul-2026
Web References: https://www.nature.com/articles/s41586-026-10709-y
References: Lo et al., Nature (July 15, 2026). DOI: 10.1038/s41586-026-10709-y
Image Credits:
Keywords: quantum computing; non-Abelian anyons; topological qutrits; universal gate set; quantum error correction; braiding and fusion; trapped-ion processor

Quantum computing has long been heralded as the next frontier for computational power, aiming to solve problems far beyond the reach of classical machines. Yet, despite impressive progress in manipulating quantum bits, or qubits, current devices grapple with formidable challenges. Quantum information is extraordinarily delicate, susceptible to decoherence and errors from environmental noise and operational imperfections. As the number of qubits increases, error rates typically escalate, severely limiting practical applications that require millions of qubits for meaningful simulation tasks in quantum chemistry, cryptography, and optimization.

Overcoming these hurdles necessitates sophisticated quantum error correction schemes. Unlike classical bits, qubits can suffer from both bit-flip and phase-flip errors, complicating correction efforts. Traditional methods rely heavily on codes with near-zero data rates, meaning vast physical qubit overheads are required to encode a small fraction of reliable logical qubits. This inefficiency has long been a bottleneck in scaling quantum processors to sizes necessary for practical computation.

The engineering challenge of stabilizing and controlling large numbers of qubits is exacerbated by short coherence times, noisy gate operations, limited qubit connectivity, and the extreme cooling requirements intrinsic to quantum hardware. Even if these hardware issues were mitigated in a hypothetical ideal machine, the field has faced a fundamental theoretical impasse: existing quantum error-correcting codes lack the sharp threshold phenomena and high coding rates that would unlock improved performance as system size grows.

Enter the novel approach developed by Associate Professor Kenta Kasai and his student Daiki Kawamoto at the Institute of Science Tokyo. Leveraging insights from classical information theory, they constructed protograph LDPC codes defined over non-binary finite fields, a departure from conventional binary-based quantum LDPC codes. This structural innovation allows the encoding of more information per qubit and enhances decoding performance by avoiding detrimental short cycles within the code structure—common issues that degrade error correction in traditional designs.

Their method involves transforming these advanced LDPC codes into Calderbank-Shor-Steane (CSS) quantum codes, a well-established family that underpins most quantum error correction systems. This transformation harnesses the superior classical error correction capabilities of LDPC codes within a quantum framework, bridging a critical gap in code design that has limited scalability and performance in past research.

Crucially, the team introduced a sophisticated decoding strategy based on the sum-product algorithm, optimized for quantum systems to simultaneously address both bit-flip (X) and phase-flip (Z) errors. Unlike prior efforts that tended to correct these error types separately—often leading to suboptimal overall error suppression—this integrated approach enhances the code’s robustness against the full spectrum of quantum noise.

Extensive numerical simulations validated their theoretical constructs, revealing frame error rates as low as 10⁻⁴ even when scaling codes to hundreds of thousands of qubits. Such performance is remarkably close to the hashing bound, the ultimate benchmark for quantum error correction determined by information theory. Moreover, the decoding process exhibits computational complexity that scales linearly with the number of physical qubits, a pivotal feature that offers practical feasibility for real-world quantum computing implementations.

This work marks a significant paradigm shift, highlighting the potential to move beyond the historically resource-intensive regimes that have precluded large-scale quantum computation. By improving code rates to above 50% and ensuring scalable decoding efficiency, these LDPC quantum codes open pathways to constructing quantum systems with millions of logical qubits—a scale deemed necessary for breakthroughs in quantum simulation, secure communication, and advanced optimization.

Professor Kasai underscores the implications, emphasizing that this breakthrough paves the way for practical, fault-tolerant quantum architectures. It not only enhances the reliability of qubits over extended computation periods but also fundamentally changes the economic and engineering calculus of quantum device fabrication and operation. This development could compress timelines toward viable quantum advantage in scientific and industrial domains.

Beyond addressing pivotal theoretical challenges, the study also invigorates the quest for improved quantum hardware by linking advanced error correction to scalable device engineering requirements. With more efficient codes, demands on coherence times and gate fidelities could be relaxed, potentially speeding up the integration of quantum processors into practical systems.

The research, published in the journal npj Quantum Information, showcases the promise of integrating classical coding theory with quantum mechanics to surmount longstanding barriers in quantum error correction. It highlights the interdisciplinary nature of quantum technologies, drawing expertise from information theory, quantum physics, and computational science to realize novel solutions for the next generation of computational machines.

As the quantum computing ecosystem evolves, these new LDPC quantum error correction codes underscore the critical importance of algorithmic and code-based innovations alongside hardware advancements. The team’s findings deliver a roadmap for tackling the intertwined challenges of noise, scale, and computational overhead, propelling the field closer to achieving reliable, large-scale quantum information processing.

This breakthrough stands as a testament to the rapidly advancing frontier of quantum science at the Institute of Science Tokyo, a recently formed institution born from the merger of Tokyo Medical and Dental University and Tokyo Institute of Technology. Their commitment to advancing scientific knowledge with societal value is exemplified by this milestone, promising to catalyze future research and applications in quantum computation and beyond.

Subject of Research: Not applicable

Article Title: Quantum Error Correction Near the Coding Theoretical Bound

News Publication Date: 29-Sep-2025

Web References: http://dx.doi.org/10.1038/s41534-025-01090-1

References: Kenta Kasai and Daiki Kawamoto. “Quantum Error Correction Near the Coding Theoretical Bound.” npj Quantum Information, September 29, 2025.

Image Credits: Institute of Science Tokyo, Japan

Keywords: Quantum computing, Applied mathematics, Computational science, Boson sampling, Qubits, Quantum walks, Quantum information, Information science, Quantum information processing, Quantum processors

Until now, the predominant focus in quantum computing research was on increasing the sheer number of qubits on a single chip. However, this approach faces physical and technical constraints, especially when constructing ever-larger processors. The UCR team shifts this paradigm by exploring modular quantum architectures—systems where multiple smaller chips are linked together to function as an integrated quantum computer. Their key finding is the demonstration that fault-tolerant quantum computation does not require flawless connections between chips. Instead, as long as each individual chip maintains high operational fidelity, the inter-chip connections can tolerate significant noise, up to ten times noisier than intra-chip operations, without compromising the system’s ability to correct errors.

This breakthrough addresses two central challenges in quantum hardware: scalability and fault tolerance. Scalability refers to the methodical increase in system size without degradation in performance, while fault tolerance ensures that a quantum computer can automatically detect and correct errors that naturally occur due to the fragile quantum states. Quantum information is extremely susceptible to decoherence and external disturbances, making error correction not just desirable but essential for reliable quantum computation. The UCR researchers used advanced computational simulations to model six different modular quantum architectures with varying error rates and noise levels in the connection links, all inspired by realistic parameters from Google’s quantum infrastructure.

Mohamed A. Shalby, the lead author and a doctoral candidate in UCR’s Department of Physics and Astronomy, explained that their approach hinges on leveraging the existing surface code error correction scheme. The surface code is currently one of the most promising error-correcting codes for quantum information, relying on a two-dimensional lattice of physical qubits to encode a single logical qubit with high fidelity. Through extensive simulations, the team found that even when connections between chips were significantly noisier, the surface code could still function effectively, detecting and rectifying errors induced by the noisy links.

Traditional challenges in linking quantum chips arise from the noise introduced especially in inter-chip connections housed in separate cryogenic refrigerators. Unlike intra-chip operations which occur within a well-controlled environment, connecting quantum processors physically separated poses technical difficulties such as increased signal loss and interference. Despite these issues, the UCR study reveals that a fault-tolerant modular quantum computer does not need “perfect” connections—just “good enough” ones. This insight effectively lowers the barrier to scaling quantum systems by allowing current chip technologies to be interconnected while maintaining computational reliability.

This research capitalizes on a vast number of simulations, leveraging computational tools developed by the Google Quantum AI team. By simulating thousands of scenarios across various quantum chip designs and teleportation interfaces, the study paints a comprehensive picture of the noise thresholds quantum systems can tolerate. The simulation results also build on previously published work from leading institutions such as the Massachusetts Institute of Technology, evidencing a growing consensus about the feasibility of modular quantum computing.

Fault tolerance in quantum systems relies on redundancy: while classical bits are simply 0s or 1s, quantum bits (qubits) can be in superpositions, making them far more vulnerable to errors. To combat this, logical qubits are formed from clusters of physical qubits, sometimes numbering in the thousands, which collaboratively detect and correct errors. The surface code is a particularly robust logical qubit architecture due to its ability to localize and correct faults within the two-dimensional lattice configuration. UCR’s study utilizing optimized surface code teleportation interfaces further refines this approach by demonstrating noise resilience in modular chip connections.

The practical implications of this discovery are profound. By proving that modular quantum systems can tolerate realistic noise levels in their interconnections, this work provides a tangible pathway for the quantum computing community to scale up processors without waiting for optimal hardware perfection. This paves the way for building larger quantum machines sooner, accelerating quantum computation’s arrival into practical applications such as cryptography, complex molecular modeling, and artificial intelligence optimization algorithms.

Moreover, the research aligns with a strategic move toward distributed quantum computing, where quantum resources are networked across separate nodes and locations. Modular architectures inherently support this distributed nature by enabling quantum computation across multiple linked processors. The UCR team’s results thus not only aid in the physical scaling problem but also lay a foundation for scalable distributed quantum systems, which are essential for fault-tolerant quantum internet technologies.

The research team included UCR physicists Leonid P. Pryadko and Renyu Wang, along with Denis Sedov from the University of Stuttgart in Germany, in an international collaboration that reflects the global nature of quantum computing research. Supported by the National Science Foundation, this cross-institutional study combines expertise from multiple quantum research hubs, demonstrating how international cooperation accelerates innovation in this cutting-edge field.

Their paper, titled “Optimized noise-resilient surface code teleportation interfaces,” was published on August 22, 2025, in the peer-reviewed Physical Review A journal. The study represents a significant milestone on the path toward building practical, large-scale, and reliable quantum computers capable of transforming computing paradigms across scientific and industrial landscapes in the near future.

As quantum computing continues to mature, studies like this redefine what is possible with current technologies. By shifting focus from the impractical quest for perfect hardware to creating systems that effectively manage and correct imperfection, the UCR team’s findings embolden researchers and engineers to rethink quantum hardware design principles. This development will likely accelerate the commercialization and practical deployment of quantum processors, moving humanity closer to harnessing the transformative power of quantum information science.

Subject of Research: Quantum computing architectures; fault tolerance; scalable quantum systems; surface code error correction.

Article Title: Optimized noise-resilient surface code teleportation interfaces

News Publication Date: 22-Aug-2025

Web References:

• Physical Review A paper
• UCR Department of Physics and Astronomy
• Google Quantum AI
• MIT quantum research inspiration

References:
Shalby, M.A., Pryadko, L.P., Wang, R., Sedov, D. (2025). Optimized noise-resilient surface code teleportation interfaces. Physical Review A. doi:10.1103/xqrn-wdw1

Image Credits: Credit: M. Shalby, UC Riverside.

Keywords: quantum computing, modular quantum architecture, fault tolerance, surface code, quantum error correction, quantum chips, noise resilience, scalable quantum systems, quantum simulation, quantum teleportation interfaces