{
  "annotation_id": "4968297c-bcc7-400e-b2d1-35b9516e8b9f",
  "date_created": "2026-03-02T18:01:56.622000Z",
  "date_modified": "2026-03-02T18:01:56.622000Z",
  "file_hash": "cdf5f6f0689815e7d1fd3bb7c36870924767096b96eee25d3a871b36ff32aec1",
  "private": false,
  "record": {
    "abstract": "It is questionable that Grover algorithm may be more valuable than a\nclassical one, when a partial information is given in a unstructured database.\nIn this letter, to consider quantum search when a partial information is given,\nwe replace the Fourier transform in the Grover algorithm with the Haar wavelet\ntransform. We then, given a partial information $L$ to a unstructured database\nof size $N$, show that there is the improved speedup, $O(\\sqrt{N/L})$.",
    "arxiv_id": "quant-ph/0303025",
    "authors": [
      "Sangwoong Park",
      "Joonwoo Bae",
      "Younghun Kwon"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Wavelet Quantum Search Algorithm with Partial Information",
    "url": "https://arxiv.org/abs/quant-ph/0303025"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "f933e50b-8e35-4a01-a0a4-5f70206875e0",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}