{
  "annotation_id": "28f1e391-166f-4b1e-8092-ddb4b85fe9c2",
  "date_created": "2026-03-02T18:02:44.535000Z",
  "date_modified": "2026-03-02T18:02:44.535000Z",
  "file_hash": "9e79e230003642101a5998afc538f750feca191f55846f8a1f6693576b87ac33",
  "private": false,
  "record": {
    "abstract": "Quantum computers use the quantum interference of different computational\npaths to enhance correct outcomes and suppress erroneous outcomes of\ncomputations. In effect, they follow the same logical paradigm as\n(multi-particle) interferometers. We show how most known quantum algorithms,\nincluding quantum algorithms for factorising and counting, may be cast in this\nmanner. Quantum searching is described as inducing a desired relative phase\nbetween two eigenvectors to yield constructive interference on the sought\nelements and destructive interference on the remaining terms.",
    "arxiv_id": "quant-ph/9903061",
    "authors": [
      "R. Cleve",
      "A. Ekert",
      "L. Henderson",
      "C. Macchiavello",
      "M. Mosca"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "Complexity 4 (1998) 33",
    "title": "On Quantum Algorithms",
    "url": "https://arxiv.org/abs/quant-ph/9903061"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "841ce827-a224-44e9-969a-9e87dcfc11e5",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}