Related papers: Optimization of the damped quantum search
Quantum search has emerged as one of the most promising fields in quantum computing. State-of-the-art quantum search algorithms enable the search for specific elements in a distribution by monotonically increasing the density of these…
We consider the problem of finding one or more desired items out of an unsorted database. Patel has shown that if the database permits quantum queries, then mere digitization is sufficient for efficient search for one desired item. The…
In this summary we discuss two new algorithms for Grover's unsorted database search problem that claimed to have reached exponential speedup over Grover's original algorithm. One is in the quantum setting with "power queries" that allow for…
The hardness to solve an unstructured quantum search problem by a standard quantum search algorithm mainly originates from the low efficiency to amplify the amplitude of the marked state by the oracle unitary operation associated with other…
The problem of determining the (least) fixpoint of (higher-dimensional) functions over the non-negative reals frequently occurs when dealing with systems endowed with a quantitative semantics. We focus on the situation in which the…
We introduce a structured quantum search algorithm that leverages entanglement maps and a fixed-point method to minimize oracle query complexity in unsorted datasets. By partitioning qubits into rows based on their entanglement order, the…
We propose a non-Hermitian quantum annealing algorithm which can be useful for solving complex optimization problems. We demonstrate our approach on Grover's problem of finding a marked item inside of unsorted database. We show that the…
With the rising applications implemented in different domains, it is inevitable to require databases to adopt corresponding appropriate data models to store and exchange data derived from various sources. To handle these data models in a…
The standard quantum search algorithm lacks a feature, enjoyed by many classical algorithms, of having a fixed-point, i.e. a monotonic convergence towards the solution. Here we present two variations of the quantum search algorithm, which…
We investigate the generalisation of quantum search of unstructured and totally ordered sets to search of partially ordered sets (posets). Two models for poset search are considered. In both models, we show that quantum algorithms can…
Based on the realignment moments of density matrix, we study parameterized entanglement criteria for bipartite and multipartite states. By adjusting the different parameter values, our criterion can detect not only bound entangled states,…
In this paper we present a search algorithm that finds useful optical quantum states which can be created with current technology. We apply the algorithm to the field of quantum metrology with the goal of finding states that can measure a…
In this paper, we address the problem of searching for semantically similar images from a large database. We present a compact coding approach, supervised quantization. Our approach simultaneously learns feature selection that linearly…
We show that by a suitable choice of time-dependent Hamiltonian, the search for a marked item in an unstructured database can be achieved in unit time, using Adiabatic Quantum Computation. This is a considerable improvement over the…
The idea that the search efficiency can be increased with the help of a number of autonomous agents is often relevant in many situations, which is known among biologists and roboticists as a stigmergy. This is due to the fact that, in any…
The use of superposition of states in quantum computation, known as quantum parallelism, has significant advantage in terms of speed over the classical computation. It can be understood from the early invented quantum algorithms such as…
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…
We find that reinforcement exponentially reduces computation time of the quantum search problem from $\sqrt{D}$ to $\ln D$ in a $D$-dimensional system. Therefor, a reinforced quantum search is expected to exhibit an exponentially larger…
Many quantum information measures can be written as an optimization of the quantum relative entropy between sets of states. For example, the relative entropy of entanglement of a state is the minimum relative entropy to the set of separable…
It is found that Grover's quantum search algorithm is not robust against phase inversion and Hadmard transformation inaccuracies. Imperfect phase inversions and Hadmard-Walsh transformations in Grover's quantum search algorithm lead to…