{
  "id": "quant-ph/0112097",
  "version": "v1",
  "published": "2001-12-17T23:32:03.000Z",
  "updated": "2001-12-17T23:32:03.000Z",
  "title": "An entanglement monotone derived from Grover's algorithm",
  "authors": [
    "Ofer Biham",
    "Michael A. Nielsen",
    "Tobias J. Osborne"
  ],
  "comment": "7 pages",
  "doi": "10.1103/PhysRevA.65.062312",
  "categories": [
    "quant-ph"
  ],
  "abstract": "This paper demonstrates that how well a state performs as an input to Grover's search algorithm depends critically upon the entanglement present in that state; the more entanglement, the less well the algorithm performs. More precisely, suppose we take a pure state input, and prior to running the algorithm apply local unitary operations to each qubit in order to maximize the probability P_max that the search algorithm succeeds. We prove that, for pure states, P_max is an entanglement monotone, in the sense that P_max can never be decreased by local operations and classical communication.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2001-12-17T23:32:03.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "entanglement monotone",
      "grovers algorithm",
      "grovers search algorithm depends",
      "algorithm apply local unitary operations"
    ],
    "tags": [
      "journal article"
    ],
    "publication": {
      "publisher": "APS",
      "journal": "Phys. Rev. A"
    },
    "note": {
      "typesetting": "TeX",
      "pages": 7,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}