This thesis consists of three contributions to the theory of complex approximation on Riemann surfaces. It is known that if E is a closed subset of an open Riemann surface R and f is a holomorphic function on a neighbourhood of E, then it is “usually” not possible to approximate f uniformly by functions holomorphic on all of R. In Chapter 2, we show, however, that for every open Riemann surface...

We show that quantum algorithms can be used to re-prove a classical theorem in approximation theory, Jackson’s Theorem, which gives a nearly-optimal quantitative version of Weierstrass’s Theorem on uniform approximation of continuous functions by polynomials. We provide two proofs, based respectively on quantum counting and on quantum phase estimation.