相关论文: Grover's Algorithm: Quantum Database Search
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…
We analyze the performance of classical and quantum search algorithms from a thermodynamic perspective, focusing on resources such as time, energy, and memory size. We consider two examples that are relevant to post-quantum cryptography:…
Quantum hardware continues to advance, yet finding new quantum algorithms - quantum software - remains a challenge, with classically trained computer programmers having little intuition of how computational tasks may be performed in the…
Grover's algorithm provides a quadratic speedup over classical algorithms to search for marked elements in an unstructured database. The original algorithm is probabilistic, returning a marked element with bounded error. There are several…
We present a continuous time quantum search algorithm analogous to Grover's. In particular, the optimal search time for this algorithm is proportional to $\sqrt{N}$, where $N$ is the database size. This search algorithm can be implemented…
We describe a quantum algorithm to prepare an arbitrary pure state of a register of a quantum computer with fidelity arbitrarily close to 1. Our algorithm is based on Grover's quantum search algorithm. For sequences of states with suitably…
We generalize Grover's unstructured quantum search algorithm to enable it to use an arbitrary starting superposition and an arbitrary unitary matrix simultaneously. We derive an exact formula for the probability of the generalized Grover's…
Two indispensable algorithms in an introductory course on Quantum Computing are Grover's search algorithm and quantum phase estimation. Quantum counting is a simple yet beautiful blend of these two algorithms, and it is therefore an…
Searching large databases is an important problem with broad applications. The Grover search algorithm provides a powerful method for quantum computers to perform searches with a quadratic speedup in the number of required database queries…
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…
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…
One of the most important quantum algorithms ever discovered is Grover's algorithm for searching an unordered set. We give a new lower bound in the query model which proves that Grover's algorithm is exactly optimal. Similar to existing…
Studies on Quantum Computing have been developed since the 1980s, motivating researches on quantum algorithms better than any classical algorithm possible. An example of such algorithms is Grover's algorithm, capable of finding $k$ (marked)…
We establish a lower bound concerning the computational complexity of Grover's algorithms on fractal networks. This bound provides general predictions for the quantum advantage gained for searching unstructured lists. It yields a…
Since Grover's seminal work, quantum search has been studied in great detail. In the usual search problem, we have a collection of n items and we would like to find a marked item. We consider a new variant of this problem in which…
We generalize Grover algorithm with two arbitrary phases in a density matrix set up. We give exact analytic expressions for the success probability after arbitrary number of iteration of the generalized Grover operator as a function of…
Grover's quantum search algorithm provides a quadratic quantum advantage over classical algorithms across a broad class of unstructured search problems. The original protocol is probabilistic, returning the desired result with significant…
Some of the secret sharing schemes having unique quantum features like parallelism and entanglement are supposed to be relatively secure. Different schemes proposed by various researchers over the years have features which could be specific…
We propose a scheme to implement two-qubit Grover's quantum search algorithm using Cavity Quantum Electrodynamics. Circular Rydberg atoms are used as quantum bits (qubits). They interact with the electromagnetic field of a non-resonant…
We propose a new quantum circuit for the quantum search problem. The quantum circuit is superior to Grover's algorithm in some realistic cases. The reasons for the superiority are in short as follows: In the quantum circuit proposed in this…