A newly proposed framework in topological quantum field theory (TQFT) could overcome a long-standing obstacle in building a fault-tolerant quantum computer.
A team led by USC researchers has shown that by adding a single, previously discarded particle to an existing system of Ising anyons, it is possible to achieve universal quantum computation using braiding alone. Their findings, published in Nature Communications, revive a class of mathematical objects thought to be useless and offer a fresh path toward scalable quantum hardware based on topological protection.
When one extra particle makes all the difference
Ising anyons—quasiparticles theorized to exist in exotic quantum materials like the fractional quantum Hall state at ν = 5/2—have long been favored as candidates for topological quantum computing. These particles are resistant to noise and encode information in their geometric configurations, allowing computations to be carried out by “braiding” them around each other.
However, braiding Ising anyons alone can only produce a limited set of operations known as Clifford gates, which fall short of universal computation. Past proposals suggested adding unreliable operations or combining different types of anyons, but these approaches often sacrificed the topological protection that makes the system attractive in the first place.
The new solution, proposed by mathematicians Filippo Iulianelli, Sung Kim, Joshua Sussan, and Aaron D. Lauda, involves adding just one more anyon type—called α—emerging from a non-semisimple topological quantum field theory. This single addition fills the computational gap.
Neglectons: From mathematical discard to quantum catalyst
What makes α special is its origin. Traditional quantum field theories simplify their mathematics by discarding representations with “quantum trace zero.” These were long assumed to be irrelevant and are omitted through a process called semisimplification. But in the non-semisimple framework, such discarded elements are preserved and repurposed.
“It’s like finding treasure in what everyone else thought was mathematical garbage,” said senior author Aaron Lauda. His team dubbed these rescued particles “neglectons”—a nod to both their neglected status and their newfound importance. “With just one neglecton added to the mix, we can now perform any quantum computation using braiding alone.”
Key advances from the study:
- Introduced a new α-type anyon from a non-semisimple TQFT that enables universal computation.
- Showed that braiding around a stationary neglecton produces dense SU(2) operations on single qubits.
- Developed a multiqubit encoding with low leakage from the computational space.
- Adapted and extended Reichardt’s iterative method to create entangling gates with exponentially suppressed leakage.
Mathematics finds the loophole
The elegance of the proposal lies in how it quarantines the weirdness. Non-semisimple TQFTs violate unitarity—a foundational principle in quantum mechanics—but only in unused regions of the system. The team showed that the part of the Hilbert space used for actual computation retains a positive-definite structure and behaves as expected. The rest is safely out of bounds.
“Think of it like designing a quantum computer in a house with some unstable rooms,” Lauda explained. “You keep your quantum information in the safe rooms and never step into the others.”
From theory to reality
Physically realizing this framework still requires an experimental breakthrough: identifying or engineering materials where the α-anyon can emerge and remain stationary. But because Ising anyons are already under experimental investigation in condensed matter systems, the additional challenge is manageable.
Moreover, the mathematical formalism closely connects with logarithmic conformal field theories (log-CFTs), which describe systems like disordered media and boundary effects in statistical physics. That opens possible links with known quantum Hall states or new boundary conditions in spin chains.
Implications and what comes next
The result gives new hope that topological quantum computing can achieve full universality without compromising its core advantage—resistance to noise. It also highlights the role of pure mathematics in unlocking hidden potential in quantum systems.
“By embracing mathematical structures that were previously considered useless, we unlocked a whole new chapter for quantum information science,” said Lauda. Future work will explore more values of α, search for physical implementations, and develop new algorithms to handle the mathematical complexity of indefinite unitarity.
As Lauda put it, “The math gives us a clear target. If experimentalists can find this one missing particle, we’re a big step closer to realizing quantum computing’s full potential.”
Journal Reference
Filippo Iulianelli, Sung Kim, Joshua Sussan & Aaron D. Lauda. “Universal quantum computation using Ising anyons from a non-semisimple topological quantum field theory.” Nature Communications 16, 6408 (2025). DOI: 10.1038/s41467-025-61342-8
ScienceBlog.com has no paywalls, no sponsored content, and no agenda beyond getting the science right. Every story here is written to inform, not to impress an advertiser or push a point of view.
Good science journalism takes time — reading the papers, checking the claims, finding researchers who can put findings in context. We do that work because we think it matters.
If you find this site useful, consider supporting it with a donation. Even a few dollars a month helps keep the coverage independent and free for everyone.