The Solovay-Kitaev Algorithm

16 October 2013
Henry Bradford
<p>I shall outline a procedure for efficiently approximating arbitrary elements of certain topological groups by words in a finite set. The method is suprisingly general and is based upon the assumption that close to the identity, group elements may be easily expressible as commutators. Time permitting, I shall discuss some applications to uniform diameter bounds for finite groups and to quantum computation.</p>