{
  "annotation_id": "9cb16492-da9f-4887-a75d-a6511fc4e134",
  "date_created": "2026-03-02T18:02:10.345000Z",
  "date_modified": "2026-03-02T18:02:10.345000Z",
  "file_hash": "bcb5964643e9cd6f326bb0e5c156f54f17cbbbcdaa9bb4d780d621e1dff74f97",
  "private": false,
  "record": {
    "abstract": "In this paper, we will define a quantum operator that performs the inversion\nabout the mean only on a subspace of the system (Partial Diffusion Operator).\nThis operator is used in a quantum search algorithm that runs in O(sqrt{N/M})\nfor searching an unstructured list of size N with M matches such that 1\u003c= M\u003c=N.\nWe will show that the performance of the algorithm is more reliable than known\n{fixed operators quantum search algorithms} especially for multiple matches\nwhere we can get a solution after a single iteration with probability over 90%\nif the number of matches is approximately more than one-third of the search\nspace. We will show that the algorithm will be able to handle the case where\nthe number of matches M is unknown in advance such that 1\u003c=M\u003c=N in\nO(sqrt{N/M}). A performance comparison with Grover\u0027s algorithm will be\nprovided.",
    "arxiv_id": "quant-ph/0406207",
    "authors": [
      "Ahmed Younes",
      "Jon Rowe",
      "Julian Miller"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1016/j.physd.2007.12.005",
    "journal_ref": "Physica D. Vol. 237(8) pp. 1074-1078 (2007)",
    "title": "Quantum Searching via Entanglement and Partial Diffusion",
    "url": "https://arxiv.org/abs/quant-ph/0406207"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "b10b56cf-e225-4cc4-b15c-ddc41bddc8a9",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}