{
  "id": "1102.2058",
  "version": "v1",
  "published": "2011-02-10T09:01:11.000Z",
  "updated": "2011-02-10T09:01:11.000Z",
  "title": "Quantum Algorithms: Database Search and its Variations",
  "authors": [
    "Apoorva Patel"
  ],
  "comment": "This is a pedagogical article. 12 pages",
  "journal": "Physics News 40 (October 2010) 33-44",
  "categories": [
    "quant-ph"
  ],
  "abstract": "The driving force in the pursuit for quantum computation is the exciting possibility that quantum algorithms can be more efficient than their classical analogues. Research on the subject has unraveled several aspects of how that can happen. Clever quantum algorithms have been discovered in recent years, although not systematically, and the field remains under active investigation. This article is an introduction to the quantum database search algorithm. Its extension to the quantum spatial search algorithm is also described.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-02-10T09:01:11.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "variations",
      "quantum spatial search algorithm",
      "quantum database search algorithm",
      "clever quantum algorithms",
      "field remains"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 12,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1102.2058P"
    }
  }
}