Related papers: Structured search algorithm: A quantum leap
Grover discovered a quantum algorithm for identifying a target element in an unstructured search universe of N items in approximately square-root of N queries to a quantum oracle, thus achieving a square-root speed-up over classical…
The current era of quantum computing has yielded several algorithms that promise high computational efficiency. While the algorithms are sound in theory and can provide potentially exponential speedup, there is little guidance on how to…
Quantum Algorithms have long captured the imagination of computer scientists and physicists primarily because of the speed up achieved by them over their classical counterparts using principles of quantum mechanics. Entanglement is believed…
Despite the advent of Grover's algorithm for the unstructured search, its successful implementation on near-term quantum devices is still limited. We apply three strategies to reduce the errors associated with implementing quantum search…
In this work, we present a quantum query algorithm for searching a word of length $m$ in an unsorted dictionary of size $n$. The algorithm uses $O(\sqrt{n})$ queries (Grover operators), like previously known algorithms. What is new is that…
The driving force in the pursuit for quantum computation is the exciting possibility that quantum algorithms can be more efficient than their classical analogues. Research on the subject has unraveled several aspects of how that can happen.…
This paper introduces a quantum-classical hybrid algorithm for generalized pattern search (GPS) algorithms. We introduce a quantum search step algorithm using amplitude amplification, which reduces the number of oracle calls needed during…
Since Grover's seminal work which provides a way to speed up combinatorial search, quantum search has been studied in great detail. We propose a new method for designing quantum search algorithms for finding a marked element in the state…
Grover's algorithm provides a quadratic speedup over classical algorithms for searching unstructured databases and is known to be strictly optimal in oracle query complexity, with tight bounds on its success probability. Although the…
Although measurement and unitary processes can accomplish any quantum evolution in principle, thinking in terms of dissipation and damping can be powerful. We propose a modification of Grover's algorithm in which the idea of damping plays a…
This paper introduces a novel quantum embedding search algorithm (QES, pronounced as "quest"), enabling search for optimal quantum embedding design for a specific dataset of interest. First, we establish the connection between the…
The quantum search algorithm of Chen and Diao, which finds with certainty a single target item in an unsorted database, is modified so as to be capable of searching for an arbitrary specified number of target items. If the number of…
In this paper, we will use a quantum operator which performs the inversion about the mean operation only on a subspace of the system ({\it Partial Diffusion Operator}) to propose a quantum search algorithm runs in $O(\sqrt N/M})$ for…
The standard quantum search lacks a feature, enjoyed by many classical algorithms, of having a fixed point, i.e. monotonic convergence towards the solution. Recently a fixed point quantum search algorithm has been discovered, referred to as…
Quantum algorithms for searching one or more marked items on a d-dimensional lattice provide an extension of Grover's search algorithm including a spatial component. We demonstrate that these lattice search algorithms can be viewed in terms…
A quantum algorithm for combinatorial search is presented that provides a simple framework for utilizing search heuristics. The algorithm is evaluated in a new case that is an unstructured version of the graph coloring problem. It performs…
In the quantum database search problem we are required to search for an item in a database. In this paper, we consider a generalization of this problem, where we are provided d identical copes of a database each with N items which we can…
Building quantum devices using fixed operators is a must to simplify the hardware construction. Quantum search engine is not an exception. In this paper, a fixed phase quantum search algorithm that searches for M matches in an unstructured…
Quantum access to arbitrary classical data encoded in unitary black-box oracles underlies interesting data-intensive quantum algorithms, such as machine learning or electronic structure simulation. The feasibility of these applications…
Grover's algorithm is a primary algorithm offered as evidence that quantum computers can provide an advantage over classical computers. It involves an "oracle" specified for a given application whose structure is not part of the formal…