{
  "id": "quant-ph/0210068",
  "version": "v2",
  "published": "2002-10-10T11:43:17.000Z",
  "updated": "2002-10-11T11:17:43.000Z",
  "title": "An information-theoretic analysis of Grover's algorithm",
  "authors": [
    "Erdal Arikan"
  ],
  "comment": "8 pages, 1 figure, minor corrections",
  "categories": [
    "quant-ph"
  ],
  "abstract": "Grover discovered a quantum algorithm for identifying a target element in an unstructured search universe of N items in approximately square-root of N queries to a quantum oracle, thus achieving a square-root speed-up over classical algorithms. We present an information-theoretic analysis of Grover's algorithm and show that the square-root speed-up is the best attainable result using Grover's oracle.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2002-10-11T11:17:43.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "grovers algorithm",
      "information-theoretic analysis",
      "square-root speed-up",
      "best attainable result",
      "target element"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 8,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2002quant.ph.10068A"
    }
  }
}