  A method for compiling quantum algorithms into specific braiding patterns for
non-Abelian quasiparticles described by the so-called Fibonacci anyon model is
developed. The method is based on the observation that a universal set of
quantum gates acting on qubits encoded using triplets of these quasiparticles
can be built entirely out of three-stranded braids (three-braids). These
three-braids can then be efficiently compiled and improved to any required
accuracy using the Solovay-Kitaev algorithm.
