Citation: Bonesteel, Nicholas E., et al. "Braid topologies for quantum computation." Physical review letters 95.14 (2005): 140503.
Web: https://arxiv.org/abs/quant-ph/0505065
Tags: Fibonacci-anyons, Universal-scheme
This paper talks about how to find explicit braids which serve as a universal gate set in topological quantum computing with Fibonacci anyons.
What's nice about this paper is that it includes diagrams of specific braids that approximate certain basic logic gates. This makes it a great reference when finding explicit examples of what Fibonacci TQC would look like in practice. This was built on in later work to find weaves (braids with only one mobile quasiparticle) which can implement any braid:
> Simon, Steven H., et al. "Topological quantum computing with only one mobile quasiparticle." Physical review letters 96.7 (2006): 070503.
Another great reference is
> Field, Bernard, and Tapio Simula. "Introduction to topological quantum computation with non-Abelian anyons." Quantum Science and Technology 3.4 (2018): 045004.
It contains larger examples which are more representative of what braids in simple TQC procedures would look like.