{
  "id": "quant-ph/9903061",
  "version": "v1",
  "published": "1999-03-17T19:34:49.000Z",
  "updated": "1999-03-17T19:34:49.000Z",
  "title": "On Quantum Algorithms",
  "authors": [
    "R. Cleve",
    "A. Ekert",
    "L. Henderson",
    "C. Macchiavello",
    "M. Mosca"
  ],
  "comment": "15 pages, 8 figures",
  "journal": "Complexity 4 (1998) 33",
  "categories": [
    "quant-ph"
  ],
  "abstract": "Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. In effect, they follow the same logical paradigm as (multi-particle) interferometers. We show how most known quantum algorithms, including quantum algorithms for factorising and counting, may be cast in this manner. Quantum searching is described as inducing a desired relative phase between two eigenvectors to yield constructive interference on the sought elements and destructive interference on the remaining terms.",
  "revisions": [
    {
      "version": "v1",
      "updated": "1999-03-17T19:34:49.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "quantum algorithms",
      "enhance correct outcomes",
      "computational paths",
      "quantum interference",
      "suppress erroneous outcomes"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 15,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "inspire": 496937,
      "adsabs": "1999quant.ph..3061C"
    }
  }
}