In the black-box model, promise problems are the only ones that admit a quantum exponential speedup over the best classical algorithm in terms of query complexity. The most prominent example of this is the Deutsch-Jozsa algorithm. More recently, Wim van Dam put forward an algorithm for unstructured problems (ie, those without a promise). We consider the Deutsch-Jozsa algorithm with a less restr...

Full terms and conditions of use:

In this paper we present an approach to the analysis of the contribution of a small subregion in a dataset to the global flow. To this purpose, we subtract the potential flow that is induced by the boundary of the sub-domain from the original flow. Since the potential flow is free of both divergence and rotation, the localized flow field retains the original features. In contrast to similar app...

10.

We present the theory and implementation for a new automatic adaptive h-re nement and -dere nement method for twoand three-dimensional elliptic problems. An exact lower error bound for dere nement is obtained theoretically in terms of the nite element solution, complementing the various known upper error bounds for re nement. These error bounds are used to determine where to insert and/or remov...