{
  "annotation_id": "f684d689-6655-47da-8d2c-8e86f51e3b95",
  "date_created": "2026-03-02T18:02:34.101000Z",
  "date_modified": "2026-03-02T18:02:34.101000Z",
  "file_hash": "9fbd5834766f8a0270a3dc473d9e567af659c7c9aa41fac8653c1477ab8c4d73",
  "private": false,
  "record": {
    "abstract": "Evolution of entanglement with the processing 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. Biham et al [14] have shown that the success probability of search\nalgorithm can be seen as an operational measure of entanglement. Following the\nsame line of thought, analytical expressions for entanglement measure for three\nand five qubit system have been derived, which reveals that entanglement\nmeasure based on Grover\u0027s search algorithm is valid for any state with real\ncoefficients for even number of qubits.",
    "arxiv_id": "quant-ph/0702221",
    "authors": [
      "Arti Chamoli",
      "C. M. Bhandari"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Success Rate and Entanglement Evolution in Search Algorithm",
    "url": "https://arxiv.org/abs/quant-ph/0702221"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "8b6ce7ee-fd54-45d2-a778-ffb053905c2e",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}