Abstract
Grover's algorithm provides a quadratic speedup over classical algorithms to search for marked elements in an unstructured database. The original algorithm is probabilistic, returning a marked element with bounded error. There are several schemes to achieve the deterministic version, by using the generalized Grover's iteration G(α,β):=S_r(β) S_o(α) composed of phase oracle S_o(α) and phase rotation S_r(β). However, in all the existing schemes the value range of α and β is limited; for instance, in the three early schemes α and β are determined by the proportion of marked states M/N. In this paper, we break through this limitation by presenting a search framework with adjustable parameters, which allows α or β to be arbitrarily given. The significance of the framework lies not only in the expansion of mathematical form, but also in its application value, as we present two disparate problems which we are able to solve deterministically using the proposed framework, whereas previous schemes are ineffective.