{
  "id": "quant-ph/0503238",
  "version": "v2",
  "published": "2005-03-31T13:50:47.000Z",
  "updated": "2005-09-05T23:28:57.000Z",
  "title": "Optimization of Partial Search",
  "authors": [
    "Vladimir Korepin"
  ],
  "comment": "5 pages",
  "journal": "Journal of Physics A: Math. Gen. vol 38, pages L731-L738, 2005",
  "categories": [
    "quant-ph",
    "cs.DS"
  ],
  "abstract": "Quantum Grover search algorithm can find a target item in a database faster than any classical algorithm. One can trade accuracy for speed and find a part of the database (a block) containing the target item even faster, this is partial search. A partial search algorithm was recently suggested by Grover and Radhakrishnan. Here we optimize it. Efficiency of the search algorithm is measured by number of queries to the oracle. The author suggests new version of Grover-Radhakrishnan algorithm which uses minimal number of queries to the oracle. The algorithm can run on the same hardware which is used for the usual Grover algorithm.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2005-09-05T23:28:57.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "optimization",
      "quantum grover search algorithm",
      "target item",
      "partial search algorithm",
      "usual grover algorithm"
    ],
    "tags": [
      "journal article"
    ],
    "publication": {
      "doi": "10.1088/0305-4470/38/44/L02",
      "journal": "Journal of Physics A Mathematical General",
      "year": 2005,
      "month": "Nov",
      "volume": 38,
      "number": 44
    },
    "note": {
      "typesetting": "TeX",
      "pages": 5,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2005JPhA...38L.731K"
    }
  }
}