4.5 Article

Fast quantum search algorithm for databases of arbitrary size and its implementation in a cavity QED system

Journal

PHYSICS LETTERS A
Volume 375, Issue 48, Pages 4249-4254

Publisher

ELSEVIER SCIENCE BV
DOI: 10.1016/j.physleta.2011.10.016

Keywords

Quantum computation; Grover algorithm; Qudit; Cavity QED

Funding

  1. National Natural Science Foundation of China [10774192]

Ask authors/readers for more resources

We propose a method for implementing the Grover search algorithm directly in a database containing any number of items based on multi-level systems. Compared with the searching procedure in the database with qubits encoding, our modified algorithm needs fewer iteration steps to find the marked item and uses the carriers of the information more economically. Furthermore, we illustrate how to realize our idea in cavity QED using Zeeman's level structure of atoms. And the numerical simulation under the influence of the cavity and atom decays shows that the scheme could be achieved efficiently within current state-of-the-art technology. (C) 2011 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available