Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1401.7096 · Quantum Information Processing

Universal quantum computation with weakly integral anyons

Shawn Xingshan Cui, Seung-Moon Hong, Zhenghan Wang

Published May 11, 2015• 109 citations
arXivHTMLPDF
DOI
10.1007/s11128-015-1016-y

Related papers

Quantum Computation with Abelian Anyons

Seth Lloyd

arXiv:quant-ph/0004010•Quantum Information Processing•Apr 1, 2002•97 citations

Efficient topological compilation for a weakly integral anyonic model

Alex Bocharov, Shawn Xingshan Cui, Vadym Kliuchnikov +1 more

A class of anyonic models for universal quantum computation based on weakly-integral anyons has been recently proposed. While universal set of gates cannot be obtained in this context by anyon braiding alone, designing a certain type of sector charge measurement provides universality. In this paper we develop a compilation algorithm to approximate arbitrary $n$-qutrit unitaries with asymptotically efficient circuits over the metaplectic anyon model. One flavor of our algorithm produces efficient circuits with upper complexity bound asymptotically in $O({3}^{2\phantom{\rule{0.16em}{0ex}}n}\phantom{\rule{0.16em}{0ex}}log1/\ensuremath{\varepsilon})$ and entanglement cost that is exponential in $n$. Another flavor of the algorithm produces efficient circuits with upper complexity bound in $O(n\phantom{\rule{0.16em}{0ex}}{3}^{2\phantom{\rule{0.16em}{0ex}}n}\phantom{\rule{0.16em}{0ex}}log1/\ensuremath{\varepsilon})$ and no additional entanglement cost.

arXiv:1504.03383•Physical Review A•Jan 8, 2016•22 citations

Property F implies weak integrality for non-degenerate pivotal braided fusion categories

Justin Asher, Jonah Berean-Dutcher, Clay Cordova +2 more

We prove that every non-degenerate pivotal braided fusion category with property F is pseudo-unitary and weakly integral. In particular, every modular category with property F is weakly integral. Neither sphericality nor pseudo-unitarity is assumed. Passing to the Drinfeld centre extends the result to degenerate categories whose dimensions are positive on the intersection of the Müger centre with the adjoint subcategory; these include every braided fusion category with a pseudo-unitary Galois conjugate. Physically, the result connects the arithmetic of topological orders to the computational power of anyon braiding: non-integer squared total quantum dimension guarantees infinite braid group images, a necessary condition for universal quantum computation.

arXiv:2611.12836•Nov 9, 2026•0 citations

Fault-tolerant quantum computation by anyons

Alexei Kitaev

arXiv:quant-ph/9707021•Annals of Physics•Jan 1, 2003•7,671 citations

Universal Quantum Computation

Junya Kasahara

•Jan 1, 2019•1 citation

Universal quantum computation using Ising anyons from a non-semisimple topological quantum field theory

Filippo Iulianelli, Sung Kim, Joshua Sussan +1 more

We propose a framework for topological quantum computation using newly discovered non-semisimple analogs of topological quantum field theories in 2 + 1 dimensions. These enhanced theories offer more powerful models for quantum computation. The conventional theory of Ising anyons, which is believed to describe excitations in the ν = 5/2 fractional quantum Hall state, is not universal for quantum computation via braiding of quasiparticles. However, we show that the non-semisimple theory introduces new anyon types that extend the Ising framework. By adding just one new anyon type, universal quantum computation can be achieved through braiding alone. This result opens new avenues for realizing fault-tolerant quantum computing in topologically ordered systems. Ising anyons are a promising platform for topological quantum computation, but braiding alone is not universal. Here, authors show that extending to non-semi simple TQFTs introduces new anyon types that enable universal quantum computation with Ising anyons.

arXiv:2410.14860•Nature Communications•Aug 5, 2025•11 citations
A class of anyonic models for universal quantum computation based on weakly-integral anyons has been recently proposed. While universal set of gates cannot be obtained in this context by anyon braiding alone, designing a certain type of sector charge measurement provides universality. In this paper we develop a compilation algorithm to approximate arbitrary nnn-qutrit unitaries with asymptotically efficient circuits over the metaplectic anyon model. One flavor of our algorithm produces efficient circuits with upper complexity bound asymptotically in $O({3}^{2\phantom{\rule{0.16em}{0ex}}n}\phantom{\rule{0.16em}{0ex}}log1/\ensuremath{\varepsilon})$ and entanglement cost that is exponential in nnn. Another flavor of the algorithm produces efficient circuits with upper complexity bound in $O(n\phantom{\rule{0.16em}{0ex}}{3}^{2\phantom{\rule{0.16em}{0ex}}n}\phantom{\rule{0.16em}{0ex}}log1/\ensuremath{\varepsilon})$ and no additional entanglement cost.
We prove that every non-degenerate pivotal braided fusion category with property F is pseudo-unitary and weakly integral. In particular, every modular category with property F is weakly integral. Neither sphericality nor pseudo-unitarity is assumed. Passing to the Drinfeld centre extends the result to degenerate categories whose dimensions are positive on the intersection of the Müger centre with the adjoint subcategory; these include every braided fusion category with a pseudo-unitary Galois conjugate. Physically, the result connects the arithmetic of topological orders to the computational power of anyon braiding: non-integer squared total quantum dimension guarantees infinite braid group images, a necessary condition for universal quantum computation.
We propose a framework for topological quantum computation using newly discovered non-semisimple analogs of topological quantum field theories in 2 + 1 dimensions. These enhanced theories offer more powerful models for quantum computation. The conventional theory of Ising anyons, which is believed to describe excitations in the ν = 5/2 fractional quantum Hall state, is not universal for quantum computation via braiding of quasiparticles. However, we show that the non-semisimple theory introduces new anyon types that extend the Ising framework. By adding just one new anyon type, universal quantum computation can be achieved through braiding alone. This result opens new avenues for realizing fault-tolerant quantum computing in topologically ordered systems. Ising anyons are a promising platform for topological quantum computation, but braiding alone is not universal. Here, authors show that extending to non-semi simple TQFTs introduces new anyon types that enable universal quantum computation with Ising anyons.