Optimization of Partial Search
نویسنده
چکیده
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 number of queries to the oracle. The author suggests new version of Grover-Radhakrishnan algorithm which uses minimal number of queries to the oracle. The algorithm can run on the same hardware which is used for the usual Grover algorithm.
منابع مشابه
Dynamic Modeling and Controller Design of Distribution Static Compensator in a Microgrid Based on Combination of Fuzzy Set and Galaxy-based Search Algorithm
This paper presents a nonlinear controller for a Distribution Static Compensator (DSTATCOM) of a microgrid incorporating the Distributed Generation (DG) units. The nonlinear control has been designed based on partial feedback linearization theory and Proportional-Integral-Derivative (PID) controllers try to adjust the voltage and trace the output. This paper has proposed a combination of a fuz...
متن کاملAN OPTIMUM APPROACH TOWARDS SEISMIC FRAGILITY FUNCTION OF STRUCTURES THROUGH METAHEURISTIC HARMONY SEARCH ALGORITHM
Vulnerability assessment of structures encounter many uncertainties like seismic excitations intensity and response of structures. The most common approach adopted to deal with these uncertainties is vulnerability assessment through fragility functions. Fragility functions exhibit the probability of exceeding a state namely performance-level as a function of seismic intensity. A common approach...
متن کاملInvestigation of CO2 and H2O Addition to Natural Gas for Production of Synthesis Gas
General modeling and optimization of syngas production via noncatalytic autothermal partial oxidation of methane are carried out using our developed scientific software which was based on the minimization of total Gibbs energy. In this work, a novel application of the direct search and Newton-Raphson methods was introduced to apply to optimization of a complex chemical reaction. Sensitivity ana...
متن کاملRecovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems
A hybrid heuristic method for combinatorial optimization problems is proposed that combines di erent classical techniques such as tree search procedures, bounding schemes and local search. The proposed method enhances the classic beam search approach by applying to each partial solution corresponding to a node selected by the beam, a further test that checks whether the current partial solution...
متن کاملOPTIMIZATION OF SKELETAL STRUCTURES USING IMPROVED GENETIC ALGORITHM BASED ON PROPOSED SAMPLING SEARCH SPACE IDEA
In this article, by Partitioning of designing space, optimization speed is tried to be increased by GA. To this end, designing space search is done in two steps which are global search and local search. To achieve this goal, according to meshing in FEM, firstly, the list of sections is divided to specific subsets. Then, intermediate member of each subset, as representative of subset, is defined...
متن کاملImproved Cuckoo Search Algorithm for Global Optimization
The cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. To enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. Normally, the parametersof the cuckoo search are kept constant. This may lead todecreasing the efficiency of the algorithm. To cop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/quant-ph/0503238 شماره
صفحات -
تاریخ انتشار 2005