I will survey what is known about the complexity of arithmetic circuits computing polynomials and rational functions with non-commuting variables, focusing on recent results and open problems. The talk is mainly based on several papers with Pavel Hrubes and Amir Yehudayoff.