I will review work on efficient methods for finding braids to carry out quantum algorithms in a topological quantum computer using Fibonacci anyons, as well as recent extensions of this work to other (specifically SU(2)_k with k>4) nonabelian particles.