Related papers: Optimizing Quantum Search with a Binomial Version …
We investigate the performance of Grover's quantum search algorithm on a register which is subject to loss of the particles that carry the qubit information. Under the assumption that the basic steps of the algorithm are applied correctly…
Quantum search algorithm (also known as Grover's algorithm) lays the foundation for many other quantum algorithms. Although it is very simple, its implementation is limited on noisy intermediate-scale quantum (NISQ) processors. Grover's…
As the matching condition in Grover search algorithm is transgressed due to inevitable errors in phase inversions, it gives a reduction in maximum probability of success. With a given degree of maximum success, we have derive the…
In order to understand the bounds of utilization of the Grover's search algorithm for the large unstructured data in presence of the quantum computer noise, we undertake a series of simulations by inflicting various types of noise, modelled…
The question of which resources drive the advantages in quantum algorithms has long been a fundamental challenge. While entanglement and coherence are critical to many quantum algorithms, our results indicate that they do not fully explain…
We give a dimension independent formulation of the quantum search algorithm introduced in [L. K. Grover, Phys. Rev. Lett. {\bf 79}, 325 (1997)]. This algorithm provides a quadratic gain when compared to its classical counterpart by…
Quantum advantage is the core of quantum computing. Grover's search algorithm is the only quantum algorithm with proven advantage to any possible classical search algorithm. However, realizing this quantum advantage in practice is quite…
Quantum amplitude estimation is a key sub-routine of a number of quantum algorithms with various applications. We propose an adaptive algorithm for interval estimation of amplitudes. The quantum part of the algorithm is based only on…
A quantum algorithm for general combinatorial search that uses the underlying structure of the search space to increase the probability of finding a solution is presented. This algorithm shows how coherent quantum systems can be matched to…
Traditional tree search algorithms supply a blueprint for modeling problem solving behaviour. A diverse spectrum of problems can be formulated in terms of tree search. Quantum computation, in particular Grover's algorithm, has aroused a…
It may be possible to extend the Grover search algorithm by taking a divide and conquer approach using auxiliary solutions to achieve an exponential speed-up.
Given two sets A and B and two oracles O(A) and O(B) that can identify the elements of these sets respectively, the goal is to find an element common to both sets using minimum number of oracle queries. Each application of either O(A) or…
This paper presents the Maximum Amplification Optimisation Algorithm (MAOA), a novel quantum algorithm designed for combinatorial optimisation in the restricted circuit depth context of near-term quantum computing. The MAOA first produces a…
In this paper we discuss Grover Adaptive Search (GAS) for Constrained Polynomial Binary Optimization (CPBO) problems, and in particular, Quadratic Unconstrained Binary Optimization (QUBO) problems, as a special case. GAS can provide a…
We build a quantum algorithm which uses the Grover quantum search procedure in order to sample the exact equilibrium distribution of a wide range of classical statistical mechanics systems. The algorithm is based on recently developed exact…
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…
Query expansion is a well known method to improve the performance of information retrieval systems. In this work we have tested different approaches to extract the candidate query terms from the top ranked documents returned by the…
We present a scheme to prepare a quantum state in a ion trap with probability approaching to one by means of ion trap quantum computing and Grover's quantum search algorithm acting on trapped ions.
We study an oracle operation, along with its circuit design, which combined with the Grover diffusion operator boosts the probability of finding minimum or maximum solutions on a weighted directed graph. We focus on a geometry of…
Grover's unstructured search algorithm is one of the best examples to date for the superiority of quantum algorithms over classical ones. Its applicability, however, has been questioned by many due to its oracular nature. We propose a…