{
  "annotation_id": "d7379c3c-a9a6-4e2b-8c66-fddeefdbb79e",
  "date_created": "2026-03-02T18:02:40.984000Z",
  "date_modified": "2026-03-02T18:02:40.984000Z",
  "file_hash": "be039d0366dee76949a3469c299dd045951b7bcf7c9a9568d8be268c45209dc1",
  "private": false,
  "record": {
    "abstract": "Quantum computers use the quantum interference of different computational\npaths to enhance correct outcomes and suppress erroneous outcomes of\ncomputations. A common pattern underpinning quantum algorithms can be\nidentified when quantum computation is viewed as multi-particle interference.\nWe use this approach to review (and improve) some of the existing quantum\nalgorithms and to show how they are related to different instances of quantum\nphase estimation. We provide an explicit algorithm for generating any\nprescribed interference pattern with an arbitrary precision.",
    "arxiv_id": "quant-ph/9708016",
    "authors": [
      "Richard Cleve",
      "Artur Ekert",
      "Chiara Macchiavello",
      "Michele Mosca"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1098/rspa.1998.0164",
    "title": "Quantum Algorithms Revisited",
    "url": "https://arxiv.org/abs/quant-ph/9708016"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "3044f6aa-e297-46ad-b3fb-39c4d3701acc",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}