  We study high dimensional integration in the quantum model of computation. We
develop quantum algorithms for integration of functions from Sobolev classes
$W^r_p([0,1]^d)$ and analyze their convergence rates. We also prove lower
bounds which show that the proposed algorithms are, in many cases, optimal
within the setting of quantum computing. This extends recent results of Novak
on integration of functions from H\"older classes.
