Braided distributivity

In category-theoretic models for the anyon systems proposed for topological quantum computing, the essential ingredients are two monoidal structures, ⊕ and ⊗. The former is symmetric but the latter is only braided, and ⊗ is required to distribute over ⊕. 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 ⊗ 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 ⊗ is additive. Working on these results, we found a new redundancy in Laplaza's conditions.

Authors

• Andreas Blass
• Yuri Gurevich

Keywords

• Monoidal category
• Braiding
• Distributive
• Coherence condition
• Abelian category
• Anyons
• Topological quantum computing