Related papers: Quantum Search with Prior Knowledge
Grover's search algorithm is one of the first quantum algorithms to exhibit a provable quantum advantage. It forms the backbone of numerous quantum applications and is widely used in benchmarking efforts. Here, we report…
Grover search is a well-known quantum algorithm that outperforms any classical search algorithm. It is known that quantum correlations such as entanglement are necessary for the power of quantum computation. But entanglement is not the only…
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…
Grover's database search algorithm, although discovered in the context of quantum computation, can be implemented using any physical system that allows superposition of states. A physical realization of this algorithm is described using…
A fast quantum search algorithm for continuous variables is presented. The result is the quantum continuous variable analog of Grover's algorithm originally proposed for qubits. A continuous variable analog of the Hadamard (i.e., Fourier…
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…
Quantum algorithm, as compared to classical algorithm, plays a notable role in solving linear systems of equations with an exponential speedup. Here, we demonstrate a method for solving a particular system of equations by using the concept…
With reference to a search in a database of size N, Grover states: "What is the reason that one would expect that a quantum mechanical scheme could accomplish the search in O(square root of N) steps? It would be insightful to have a simple…
Grover's search algorithm was originally proposed for circuit-based quantum computers. A crucial part of it is to query an oracle -- a black-box unitary operation. Generation of this oracle is formally beyond the original algorithm design.…
The aim of this work is to develop a framework for realising quantum network algorithms with the use of prior knowledge about the structure of the network. We seek to obtain computational methods that allows us to locally determine network…
Withdrawn by the author due to irreparable errors. We present a quantum algorithm that in the black-box model performs a search in an ordered list of N elements. Using 3/4 log N + O(1) queries, it achieves a success probability of at least…
This paper describes a quantum algorithm for proof search in sequent calculus of a subset of Linear Logic using the Grover Search Algorithm. We briefly overview the Grover Search Algorithm and Linear Logic, show the detailed steps of the…
As the engineering endeavour to realise quantum computers progresses, we consider that such machines need not rely on binary as their de facto unit of information. We investigate Grover's algorithm under a generalised quantum circuit model,…
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…
We investigate optimizing quantum tree search algorithms by employing a nested Grover Algorithm. This approach seeks to enhance results compared to previous Grover-based methods by expanding the tree of partial assignments to a specific…
Quantum multi-programming is a method utilizing contemporary noisy intermediate-scale quantum computers by executing multiple quantum circuits concurrently. Despite early research on it, the research remains on quantum gates or small-size…
The success probability of a search of $M$ targets from a database of size $N$, using Grover's search algorithm depends critically on the number of iterations of the composite operation of the oracle followed by Grover's diffusion…
Recently, Andreas de Vries proposed a quantum algorithm that would find an element in an unsorted database exponentially faster than Grover's algorithm. We show that de Vries' algorithm does not work as intended and does not give any clue…
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…
The Grover search algorithm is one of the two key algorithms in the field of quantum computing, and hence it is of significant interest to describe it in the most efficient mathematical formalism. We show firstly, that Clifford's formalism…