{
  "annotation_id": "0941840d-b364-4491-b4b9-4d704494be9d",
  "date_created": "2026-03-02T18:02:41.047000Z",
  "date_modified": "2026-03-02T18:02:41.047000Z",
  "file_hash": "454e4db589094e0a4b6f7d832e68d8128475a9eaca7e8789daf411ad921b076e",
  "private": false,
  "record": {
    "abstract": "A quantum computer has a clear advantage over a classical computer for\nexhaustive search. The quantum mechanical algorithm for exhaustive search was\noriginally derived by using subtle properties of a particular quantum\nmechanical operation called the Walsh-Hadamard (W-H) transform. This paper\nshows that this algorithm can be implemented by replacing the W-H transform by\nalmost any quantum mechanical operation. This leads to several new applications\nwhere it improves the number of steps by a square-root. It also broadens the\nscope for implementation since it demonstrates quantum mechanical algorithms\nthat can readily adapt to available technology.",
    "arxiv_id": "quant-ph/9712011",
    "authors": [
      "Lov K. Grover"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.80.4329",
    "journal_ref": "Phys.Rev.Lett.80:4329-4332,1998",
    "title": "Quantum computers can search rapidly by using almost any transformation",
    "url": "https://arxiv.org/abs/quant-ph/9712011"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "d452c295-26ff-421f-a296-ad9c0c36142f",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}