Quantum computing’s “dark horse” just proved it can go universal

Researchers from UChicago PME, Harvard, Stony Brook, and Quantinuum demonstrated a universal gate set using non-Abelian anyons, proving their potential for universal quantum computing and possibly reducing costly error correction steps.