Can Barrington's Theorem be used to speed up computation of some function ? How?
Barrington's theorem probably isn't going to be useful to speed up computation.  Rather, it's a useful way to understand the power of different computing models.  For instance, it has been used to prove facts about what can be computed with log-depth circuits.  It has also been used as a tool in building fully homomorphic cryptosystems.