English

Braided distributivity

Category Theory 2020-03-03 v2 Logic in Computer Science

Abstract

In category-theoretic models for the anyon systems proposed for topological quantum computing, the essential ingredients are two monoidal structures, \oplus and \otimes. The former is symmetric but the latter is only braided, and \otimes is required to distribute over \oplus. What are the appropriate coherence conditions for the distributivity isomorphisms? We came to this question working on a simplification of the category-theoretical foundation of topological quantum computing, which is the intended application of the research reported here. This question was answered by Laplaza when both monoidal structures are symmetric, but topological quantum computation depends crucially on \otimes being only braided, not symmetric. We propose coherence conditions for distributivity in this situation, and we prove that our conditions are (a) strong enough to imply Laplaza's when the latter are suitably formulated, and (b) weak enough to hold when --- as in the categories used to model anyons --- the additive structure is that of an abelian category and the braided \otimes is additive. Working on these results, we found a new redundancy in Laplaza's conditions.

Keywords

Cite

@article{arxiv.1807.11403,
  title  = {Braided distributivity},
  author = {Andreas Blass and Yuri Gurevich},
  journal= {arXiv preprint arXiv:1807.11403},
  year   = {2020}
}

Comments

This is a companion paper for article "Witness algebra and anyon braiding," arXiv:1807.10414, proving results used there

R2 v1 2026-06-23T03:19:11.100Z