motivated by quantum information theory, we study log-sobolev inequalities for matrix valued functions on finite graphs and compact lie groups. using tools from noncommutative geometry we find a surprising link between graph laplacians and sublaplacians on the orthogonal group. simple combinatorial tools, namely the existence of a spanning tree, then allows us to find concrete lower bounds for spectral gaps. joint work with h. li and n. laracuente.