On quantum computation, anyons, and categories
classification
🪐 quant-ph
keywords
anyonscalculationscasecategoriescategorycertaincomputationdescribing
read the original abstract
We explain the use of category theory in describing certain sorts of anyons. Yoneda's lemma leads to a simplification of that description. For the particular case of Fibonacci anyons, we also exhibit some calculations that seem to be known to the experts but not explicit in the literature.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.