Robust Universal Braiding with Non-semisimple Ising Anyons
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
Non-semisimple extensions of the Ising anyon model developed in our previous work enable universal topological quantum computation via braiding alone, overcoming the Clifford-only limitation of semisimple theories. The non-semisimple theory provides new anyon types indexed by a real parameter $α$, the neglecton. Braiding acts unitarily with respect to an indefinite Hermitian form, while the computational subspace sits in a positive-definite sector. We demonstrate that this universality is robust, persisting over an open interval of the neglecton parameter $α$ where the computational subspace remains positive-definite. We identify special values of $α$ where the physical subspace decouples exactly from negative-norm components, ensuring fully unitary evolution and suppressed leakage. We further present an alternative encoding supporting exact single-qubit Clifford gates alongside a non-Clifford phase gate. We show that high-precision tuning of $α$ is not required for efficient gate compilation, significantly enhancing the physical plausibility of non-semisimple anyonic architectures.