3

Yes, this is true, and there is a proof which closely tracks your intuition. As you know, this estimate can be proved in the continuum by applying the Sobolev embedding twice, first to get $\nabla u \in L^p$ for $p<\frac{2d}{d-2}=6$, and then once more to get $u\in L^\infty$. So for simplicity let me discuss how to get discrete versions of the Sobolev ...


1

I'll posit that perhaps asking for a taxonomy on quantum algorithms might be overly narrowing, and searching for elusive superpolynomial speedups might be white whales. In actuality quantum computation might offer opportunities that are somewhat orthogonal to anything conceivable classically. As an example, I think of proposals for quantum money, such as by ...


Only top voted, non community-wiki answers of a minimum length are eligible