  We consider the computation of the mean of sequences in the quantum model of
computation. We determine the query complexity in the case of sequences which
satisfy a $p$-summability condition for $1\le p<2$. This settles a problem left
open in Heinrich (2001).
