{
  "annotation_id": "e1f10400-a4a8-433d-8efc-fe5c4a1dbd37",
  "date_created": "2026-03-02T18:02:44.606000Z",
  "date_modified": "2026-03-02T18:02:44.606000Z",
  "file_hash": "4314104651433725a3a1d88900863295d6361deecd3381f5c3f6909d1eac169f",
  "private": false,
  "record": {
    "abstract": "We recast Grover\u0027s generalised search algorithm in a geometric language even\nwhen the states are not approximately orthogonal. We provide a possible search\nalgorithm based on an arbitrary unitary transformation which can speed up the\nsteps still further. We discuss the lower and upper bounds on the transition\nmatrix elements when the unitary operator changes with time, thereby implying\nthat quantum search process can not be too fast or too slow. This is a\nremarkable feature of quantum computation unlike classical one. Quantum\nmechanical uncertainty relation puts bounds on search process. Also we mention\nthe problems of perturbation and other issues in time-dependent search\noperation.",
    "arxiv_id": "quant-ph/9807067",
    "authors": [
      "Arun Kumar Pati"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Fast quantum search algorithm and Bounds on it",
    "url": "https://arxiv.org/abs/quant-ph/9807067"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "d7010b42-80fc-4a90-b787-7f5f4ec0baf5",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}