SinceGrover’s seminalworkwhich provides away to speed up combinatorial search, quantum search has been studied in great detail. We propose a newmethod for designing quantum search algorithms for finding a marked element in the state space of a graph. The algorithm is based on a local adiabatic evolution of the Hamiltonian associated with the graph. The main new idea is to apply some techniques ...

A quantum algorithm for an oracle problem can be understood as a quantum strategy for a player in a two-player zero-sum game in which the other player is constrained to play classically. I formalize this correspondence and give examples of games (and hence oracle problems) for which the quantum player can do better than would be possible classically. The most remarkable example is the Bernstein...

Quantum mechanical computers can solve certain problems asymptotically faster than classical computers. One of the major advantages of quantum computation comes from a fast algorithm for the problem of finding a marked item among N items. Whereas a classical computer requires Θ(N) steps to solve this problem, Grover showed that a quantum computer can solve it using only O( √ N) steps [1], which...

In order to obtain the directions for multiple moving targets under impulsive noise environment, a novel maximum likelihood (ML) algorithm based on quantum cultural geese swarm algorithm (QCGSA) is proposed. The method first sets a special array structure of nonuniform linear array, and then locates the targets in a changing search range, and then designs QCGSA to resolve ML function. Utilizing...

Quantum Grover search algorithm can find a target item in a database faster than any classical algorithm. One can trade accuracy for speed and find a part of the database (a block) containing the target item even faster, this is partial search. A partial search algorithm was recently suggested by Grover and Radhakrishnan. Here we optimize it. Efficiency of the search algorithm is measured by nu...

A quantum algorithm for an oracle problem can be understood as a quantum strategy for a player in a two-player zero-sum game in which the other player is constrained to play classically. I formalize this correspondence and give examples of games (and hence oracle problems) for which the quantum player can do better than would be possible classically. The most remarkable example is the Bernstein...

We study some extensions of Grover’s quantum searching algorithm. First, we generalize the Grover iteration in the light of a concept called amplitude amplification. Then, we show that the quadratic speedup obtained by the quantum searching algorithm over classical brute force can still be obtained for a large family of search problems for which good classical heuristics exist. Finally, as our ...

With reference to a search in a database of size N , Grover states: ”What is the reason that one would expect that a quantum mechanical scheme could accomplish the search in O “√ N ” steps? It would be insightful to have a simple two line argument for this without having to describe the details of the search algorithm”. The answer provided in this work is: ”because any quantum algorithm takes t...

response surface methodology is a common tool in optimizing processes. it mainly concerns situations when there is only one response of interest. however, many designed experiments often involve simultaneous optimization of several quality characteristics. this is called a multiresponse surface optimization problem. a common approach in dealing with these problems is to apply desirability funct...

economic dispatch with valve point effect and prohibited operating zones (pozs) is a non-convex and discontinuous optimization problem. harmony search (hs) is one of the recently presented meta-heuristic algorithms for solving optimization problems, which has different variants. the performances of these variants are severely affected by selection of different parameters of the algorithm. intel...