相关论文: Implementing Grover's Quantum Search on a Para-Hyd…

We present a method for realizing efficiently Grover's search algorithm in an array of coupled cavities doped with three-level atoms. We show that by encoding information in the lowest two ground states of the dopants and through the…

Grover's algorithm, orginally conceived as a means of searching an unordered database, can also be used to extract solutions from the result sets generated by quantum computations. The Grover algorithm exploits the concept of an oracle…

A continuous, analog version of the Grover algorithm is realized using NMR. The system studied is 23Na in a liquid crystal medium. The presence of quadrupolar coupling makes the spin I=3/2 nucleus a 2-qubit system. Applying a specially…

Generalized Grover's searching algorithm for the case in which there are multiple marked states is demonstrated on a nuclear magnetic resonance (NMR) quantum computer. The entangled basis states (EPR states) are synthesized using the…

We consider Grover's search algorithm on a model quantum computer implemented on a chain of four or five nuclear spins with first and second neighbour Ising interactions. Noise is introduced into the system in terms of random fluctuations…

The Grover search algorithm is a pivotal advancement in quantum computing, promising a remarkable speedup over classical algorithms in searching unstructured large databases. Here, we report results for the implementation and…

L. K. Grover's search algorithm in quantum computing gives an optimal, square-root speedup in the search for a single object in a large unsorted database. In this paper, we expound Grover's algorithm in a Hilbert-space framework that…

Grover search is a renowned quantum search algorithm that leverages quantum superposition to find a marked item with quadratic speedup. However, when implemented on Noisy Intermediate-scale Quantum (NISQ) hardware, the required repeated…

A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum…

Grover's quantum search algorithm is considered as one of the milestone in the field of quantum computing. The algorithm can search for a single match in a database with $N$ records in $O(\sqrt{N})$ assuming that the item must exist in the…

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…

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…

Grover's quantum search algorithm drives a quantum computer from a prepared initial state to a desired final state by using selective transformations of these states. Here, we analyze a framework when one of the selective trasformations is…

The research community has been actively working on the realization of quantum computer. But the large scale commercial quantum computers are not a reality yet quantum computing field has become richer by day with the advent of algorithms…

We report the realization, using nuclear magnetic resonance techniques, of the first quantum computer that reliably executes an algorithm in the presence of strong decoherence. The computer is based on a quantum error avoidance code that…

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…

Current experiments in liquid-state nuclear magnetic resonance quantum computing are limited by low initial polarization. To address this problem, we have investigated the use of optical pumping techniques to enhance the polarization of a…

The rapid progress of computer science has been accompanied by a corresponding evolution of computation, from classical computation to quantum computation. As quantum computing is on its way to becoming an established discipline of…

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…

In standard Grover's algorithm for quantum searching, the probability of finding the marked item is not exactly 1. In this Letter we present a modified version of Grover's algorithm that searches a marked state with full successful rate.…