Related papers: Scalable quantum search using trapped ions
Grover's quantum search algorithm evolves a quantum system from a known source state $|s\rangle$ to an unknown target state $|t\rangle$ using the selective phase inversions, $I_{s}$ and $I_{t}$, of these two states. In one of the…
We provide a tight analysis of Grover's recent algorithm for quantum database searching. We give a simple closed-form formula for the probability of success after any given number of iterations of the algorithm. This allows us to determine…
In this paper, we will define a quantum operator that performs the inversion about the mean only on a subspace of the system (Partial Diffusion Operator). This operator is used in a quantum search algorithm that runs in O(sqrt{N/M}) for…
In this letter, we show that the laser Hamiltonian can perform the quantum search. We also show that the process of quantum search is a resonance between the initial state and the target state, which implies that Nature already has a…
Quantum computing has advanced rapidly in recent years and has shown advantages in a variety of domains. In this paper, we investigate its potential for discrete simulation optimization in the fixed-confidence setting, a fundamental problem…
We propose an experimentally feasible scheme to achieve quantum computation based solely on geometric manipulations of a quantum system. The desired geometric operations are obtained by driving the quantum system to undergo appropriate…
Grover's algorithm, a well-know quantum search algorithm, allows one to find the correct item in a database, with quadratic speedup. In this paper we adapt Grover's algorithm to the problem of finding a correct answer to a natural language…
One of the significant breakthroughs in quantum computation is Grover's algorithm for unsorted database search. Recently, the applications of Grover's algorithm to solve global optimization problems have been demonstrated, where unknown…
Using Grover algorithm, this work investigates a technique for encoding search phrases used in wildcard searches. The technique involves creating a phase Oracle that loads data into a quantum circuit together with the search terms that have…
Trapped ions are a promising tool for building a large-scale quantum computer. However, the number of required radiation fields for the realisation of quantum gates in any proposed ion-based architecture scales with the number of ions…
We introduce a novel deterministic quantum search algorithm that provides a practical alternative to conventional probabilistic search approaches. Our scheme eliminates the inherent uncertainty of quantum search without relying on arbitrary…
A mixed-species geometric phase gate has been proposed for implementing quantum logic spectroscopy on trapped ions that combines probe and information transfer from the spectroscopy to the logic ion in a single pulse. We experimentally…
Scaling quantum information processors is a challenging task, requiring manipulation of a large number of qubits with high fidelity and a high degree of connectivity. For trapped ions, this could be realized in a two-dimensional array of…
An analysis on the damped quantum search by exploring the rate at which the target state is obtained. The results were compared with that of the classical search since the standard Grover's algorithm does not give a convergent result if the…
Grover's quantum search algorithm is analyzed for the case in which the initial state is an arbitrary pure quantum state $|\phi>$ of $n$ qubits. It is shown that the optimal time to perform the measurement is independent of $| \phi>$,…
The search of an unstructured database amounts to finding one element having a certain property out of $N$ elements. The classical search with an oracle checking one element at a time requires on average $N/2$ steps. The Grover algorithm…
A generalized quantum search algorithm, where phase inversions for the marked state and the prepared state are replaced by $\pi/2$ phase rotations, is realized in a 2-qubit NMR heteronuclear system. The quantum algorithm searches a marked…
We demonstrate the implementation of Grover's quantum search algorithm on a liquid state nuclear magnetic resonance (NMR) quantum computer using essentially pure states. This was achieved using a two qubit device where the initial state is…
Grover's algorithm is one of the most important quantum algorithms, which performs the task of searching an unsorted database without a priori probability. Recently the adiabatic evolution has been used to design and reproduce quantum…
Quantum computers are expected to achieve a significant speed-up over classical computers in solving a range of computational problems. Chains of ions held in a linear Paul trap are a promising platform for constructing such quantum…