# Does the GLOA have any advantage over the Solovay-Kitaev algorithm?

The Solvay Kitaev algorithm was discovered long before the Group Leaders Optimization algorithm and it has some nice theoretical properties. As far as I understand, both have exactly the same goals: given a finite dimensional unitary operator, they decompose the operator into basic quantum gates. I couldn't find any theoretical results about the time complexity or convergence time or error bounds for the GLOA as such. Does the latter (GLOA) have any practical advantage over the former at all, in terms of convergence time or anything?

P.S: For a detailed description of the GLOA, see: Understanding the Group Leaders Optimization Algorithm

• I don’t know anything about GLOA, but nowadays there are better algorithms than Solovay-Kitaev – DaftWullie Oct 22 '18 at 5:46
• As a side question, do you have any link to resources about these algorithms? Or at least their name? @DaftWullie – Nelimee Oct 22 '18 at 6:53
• @Nelimee Sure, I just had to be on a decent computer to find the link I had. Try this one: arxiv.org/abs/1212.6253 – DaftWullie Oct 22 '18 at 8:50
• Thanks! But even if the algorithm is better in terms of complexity, it does not replace the SK algorithm. I though you were speaking of an algorithm as general as SK. – Nelimee Oct 22 '18 at 9:32
• @Nelimee the Ross-Selinger algorithm is not just better in terms of complexity than the Solvay-Kitaev algorithm, it has been implemented in practice and is very fast (were talking seconds to achieve errors in the $10^{-3}$ range and is the standard tool for doing approximate circuit synthesis on Clifford+T gate sets. In what way does it not replace the SK algorithm? – Connor Jul 7 at 19:01