{
  "annotation_id": "4f8851bd-a8f6-4a0a-a0b9-3c967a424038",
  "date_created": "2026-03-02T18:02:30.429000Z",
  "date_modified": "2026-03-02T18:02:30.429000Z",
  "file_hash": "55c776e0dab01e1f9b99dce2068ef0c6adb15a2fc1bac1048ea031871ef84276",
  "private": false,
  "record": {
    "abstract": "Evolution of entanglement with the proceeding of quantum algorithms affects\nthe outcome of the algorithm. Particularly, the performance of Grover\u0027s search\nalgorithm gets worsened if the initial state of the algorithm is an entangled\none. The success probability of search can be seen as an operational measure of\nentanglement. This paper demonstrates an entanglement measure based on the\nperformance of Grover\u0027s search algorithm for three and five qubit systems. We\nalso show that although the overall pattern shows growth of entanglement, its\nrise to a maximum and then consequent decay, the presence of local fluctuation\nwithin each iterative step is likely.",
    "arxiv_id": "quant-ph/0609064",
    "authors": [
      "Arti Chamoli",
      "C. M. Bhandari"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Groverian entanglement measure and evolution of entanglement in search   algorithm for n(=3 and 5)-qubit systems with real coefficients",
    "url": "https://arxiv.org/abs/quant-ph/0609064"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "8073fc58-806e-44e2-81e2-95ee870f5fe9",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}