Generalized Jaynes-Cummings model as a quantum search algorithm

Journal Article · Wed Jul 15 00:00:00 EDT 2009 · Physical Review. A

DOI:https://doi.org/10.1103/PHYSREVA.80.014302· OSTI ID:21313360

Romanelli, A ^[1]

---

1. Instituto de Fisica, Facultad de Ingenieria, Universidad de la Republica, C.C. 30, C.P. 11000, Montevideo (Uruguay)

We propose a continuous time quantum search algorithm using a generalization of the Jaynes-Cummings model. In this model the states of the atom are the elements among which the algorithm realizes the search, exciting resonances between the initial and the searched states. This algorithm behaves like Grover's algorithm; the optimal search time is proportional to the square root of the size of the search set and the probability to find the searched state oscillates periodically in time. In this frame, it is possible to reinterpret the usual Jaynes-Cummings model as a trivial case of the quantum search algorithm.

• OSTI ID: 21313360
• Journal Information: Physical Review. A, Vol. 80, Issue 1; Other Information: DOI: 10.1103/PhysRevA.80.014302; (c) 2009 The American Physical Society; Country of input: International Atomic Energy Agency (IAEA); ISSN 1050-2947
• Country of Publication: United States
• Language: English

Related Subjects

74 ATOMIC AND MOLECULAR PHYSICS
ALGORITHMS
ATOMS
PERIODICITY
PROBABILITY
RESONANCE