Related papers: Quantum multi-programming for Grover's search
Simulating quantum circuits using classical computers can accelerate the development and validation of quantum algorithms. Our newly developed algorithm, variational quantum search (VQS), has shown an exponential advantage over Grover's…
The translation of Grover's search algorithm from its standard version, designed for implementation on a single quantum system amenable to projective measurements, into one suitable for an ensemble of quantum computers, whose outputs are…
Grover's algorithm for quantum searching is generalized to deal with arbitrary initial complex amplitude distributions. First order linear difference equations are found for the time evolution of the amplitudes of the marked and unmarked…
We report the experimental implementation of Grover's quantum search algorithm on a quantum computer with three quantum bits. The computer consists of molecules of $^{13}$C-labeled CHFBr$_2$, in which the three weakly coupled spin-1/2…
We present a full implementation and simulation of a novel quantum reinforcement learning method. Our work is a detailed and formal proof of concept for how quantum algorithms can be used to solve reinforcement learning problems and shows…
For a specific quantum chip, multi-programming helps to improve overall throughput and resource utilization. However, the previous solutions for mapping multiple programs onto a quantum chip often lead to resource under-utilization, high…
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 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…
Quantum algorithms and circuits can, in principle, outperform the best non-quantum (classical) techniques for some hard computational problems. However, this does not necessarily lead to useful applications. To gauge the practical…
Grover's search algorithm has attracted great attention due to its quadratic speedup over classical algorithms in unsorted database search problems. However, Grover's algorithm is inefficient in multi-target search problems, except in the…
There are major advantages in a newer version of Grover's quantum algorithm utilizing a general unitary transformation in the search of a single object in a large unsorted database. In this paper, we generalize this algorithm to multiobject…
Grover's search algorithms, including various partial Grover searches, experience scaling problems as the number of iterations rises with increased qubits, making implementation more computationally expensive. This paper combines Partial…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum…
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…
We describe a simulation method for a quantum spin model of a generic, general purpose quantum computer. The use of this quantum computer simulator is illustrated through several implementations of Grover's database search algorithm. Some…
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. Quantum search algorithm can be described as the rotation of state vectors in…
We consider the problem of search of an unstructured list for a marked element, when one is given advice as to where this element might be located, in the form of a probability distribution. The goal is to minimise the expected number of…
The landmark Grover algorithm for amplitude amplification serves as an essential subroutine in various type of quantum algorithms, with guaranteed quantum speedup in query complexity. However, there have been no proposal to realize the…
Grover's algorithm is a quantum search algorithm that proceeds by repeated applications of the Grover operator and the Oracle until the state evolves to one of the target states. In the standard version of the algorithm, the Grover operator…
We demonstrated the detailed construction of the hybrid quantum-classical computer. Based on this architecture, the useful concept of amplitude interception is illustrated. It is then embedded into a combination of Depth-First Search and…