Quantum search protocol for an atomic array

Marlan O. Scully and M. Suhail Zubairy
Phys. Rev. A 64, 022304 – Published 5 July 2001
PDFExport Citation

Abstract

Quantum computers can, in principle, exceed the speed of ordinary computers by taking advantage of quantum coherence and entanglement. It is possible to find a “needle in a haystack” of N1 straws in only N searches by utilizing coherent superposition states. In the present paper we show how modern quantum optics may provide a simple and practicable quantum search procedure, which may also yield insights into quantum search algorithms in general.

  • Received 6 October 1999

DOI:https://doi.org/10.1103/PhysRevA.64.022304

©2001 American Physical Society

Authors & Affiliations

Marlan O. Scully1,2 and M. Suhail Zubairy1,3

  • 1Department of Physics, Texas A&M University, College Station, Texas 77843-4242
  • 2Max-Planck-Institut für Quantenoptik, 85748 Garching, Germany
  • 3Department of Electronics, Quaid-i-Azam University, Islamabad, Pakistan

Comments & Replies

Comment on “quantum search protocol for an atomic array”

Mark W. Coffey
Phys. Rev. A 66, 046301 (2002)

Reply to “Comment on ‘Quantum search protocol for an atomic array’ ”

Marlan O. Scully and M. Suhail Zubairy
Phys. Rev. A 66, 056301 (2002)

References (Subscription Required)

Click to Expand
Issue

Vol. 64, Iss. 2 — August 2001

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×