Random Bit Quadrature and Approximation of Distributions on Hilbert Spaces

We study the approximation of expectations $${text {e}}(f(x))$$ for gaussian random elements x with values in a separable hilbert space h and lipschitz continuous functionals $$f :h rightarrow {{mathbb {r}}}$$ . we consider restricted monte carlo algorithms, which only use random bits instead of random numbers. we determine the asymptotics (in some cases sharp up to multiplicative constants, in the other cases sharp up to logarithmic factors) of the corresponding n-th minimal error in terms of the decay of the eigenvalues of the covariance operator of x. it turns out that, within the margins from above, restricted monte carlo algorithms are not inferior to arbitrary monte carlo algorithms, and suitable random bit multilevel algorithms are optimal. the analysis of this problem leads to a variant of the quantization problem, namely the optimal approximation of probability measures on h by uniform distributions supported by a given finite number of points. we determine the asymptotics (up to multiplicative constants) of the error of the best approximation for the one-dimensional standard normal distribution, for gaussian measures as above, and for scalar autonomous sdes.