相关论文: Experimental NMR Realization of A Generalized Quan…

An important and usual problem is to search all states we want from a database with a large number of states. In such, recall is vital. Grover's original quantum search algorithm has been generalized to the case of multiple solutions, but…

We describe the experimental implementation of a recently proposed quantum algorithm involving quantum entanglement at the level of two qubits using NMR. The algorithm solves a generalisation of the Deutsch problem and distinguishes between…

Quantum Search Algorithm made a big impact by being able to solve the search problem for a set with $N$ elements using only $O(\sqrt{N})$ steps. Unfortunately, it is impossible to reduce the order of the complexity of this problem, however,…

The use of superposition of states in quantum computation, known as quantum parallelism, has significant advantage in terms of speed over the classical computation. It can be understood from the early invented quantum algorithms such as…

We demonstrate the implementation of a quantum algorithm for estimating the number of matching items in a search operation using a two qubit nuclear magnetic resonance (NMR) quantum computer.

The hardness to solve an unstructured quantum search problem by a standard quantum search algorithm mainly originates from the low efficiency to amplify the amplitude of the marked state by the oracle unitary operation associated with other…

While limitations on quantum computation by Markovian environmental noise are well-understood in generality, their behavior for different quantum circuits and noise realizations can be less universal. Here we consider a canonical quantum…

The search for "a quantum needle in a quantum haystack" is a metaphor for the problem of finding out which one of a permissible set of unitary mappings---the oracles---is implemented by a given black box. Grover's algorithm solves this…

By studying the attribute of the inversion about average operation in quantum searching algorithm, we find the similarity between the quantum searching and the course of two rigid bodies'collision. Some related questions are discussed from…

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…

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…

Quantum robots are described as mobile quantum computers and ancillary systems that move in and interact with arbitrary environments. Their dynamics is given as tasks which consist of sequences of alternating computation and action phases.…

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…

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…

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…

This paper researches how the systematic errors in phase inversions affect the success rate and the number of iterations in optimized quantum random-walk search algorithm. Through geometric description of this algorithm, the model of the…

Quantum algorithms for unstructured search problems rely on the preparation of a uniform superposition, traditionally achieved through Hadamard gates. However, this incidentally creates an auxiliary search space consisting of nonsensical…

It is exponentially hard to simulate quantum systems by classical algorithms, while quantum computer could in principle solve this problem polynomially. We demonstrate such an quantum-simulation algorithm on our NMR system to simulate an…

Grover's algorithm achieves a quadratic speedup over classical algorithms, but it is considered necessary to know the value of $\lambda$ exactly [Phys. Rev. Lett. 95, 150501 (2005); Phys. Rev. Lett. 113, 210501 (2014)], where $\lambda$ is…

We provide a noisy intermediate-scale quantum framework for simulating the dynamics of open quantum systems, generalized time evolution, non-linear differential equations and Gibbs state preparation. Our algorithm does not require any…