{
  "annotation_id": "4bac9803-3ee3-49bd-b597-13b915cfe1fb",
  "date_created": "2026-03-02T18:02:48.576000Z",
  "date_modified": "2026-03-02T18:02:48.576000Z",
  "file_hash": "829a971e6628e1e72b692e1db30e51f0812c5b8c2b3173c559a3271da283c178",
  "private": false,
  "record": {
    "abstract": "This paper describes a quantum algorithm for finding the maximum among N\nitems. The classical method for the same problem takes O(N) steps because we\nneed to compare two numbers in one step. This algorithm takes O(sqrt(N)) steps\nby exploiting the property of quantum states to exist in a superposition of\nstates and hence performing an operation on a number of elements in one go. A\ntight upper bound of 6.8(sqrt(N)) for the number of steps needed using this\nalgorithm was found. These steps are the number of queries made to the oracle.",
    "arxiv_id": "quant-ph/9911082",
    "authors": [
      "Ashish Ahuja",
      "Sanjiv Kapoor"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "A Quantum Algorithm for finding the Maximum",
    "url": "https://arxiv.org/abs/quant-ph/9911082"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "3b06c907-d521-4bf0-ac13-49ccac03146f",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}