Quantum approximation on anisotropic Sobolev and Hölder-Nikolskii classes (Q763719)

\textit{S. Heinrich} [J. Complexity 20, No. 1, 27--45 (2004; Zbl 1082.68030)] determined the query complexity of the approximation of embeddings from classical Sobolev space \(W_p^r (I^d)\) into \(L_q(I^d) \), where \((I^d) = [0,1]^d\). In particular, the foregoing results show that when \(p<q\), quantum algorithms can bring a squaring speedup over classical deterministic and randomized algorithms. In this paper, the author partially answers the problem that given \(L_q(I^d) \), for which kind of function classes quantum computation can bring or not bring speedup on the approximation in the space.