{
  "annotation_id": "c4545fdd-94bb-4a5f-bdce-63138c4a30b5",
  "date_created": "2026-03-02T18:01:59.475000Z",
  "date_modified": "2026-03-02T18:01:59.475000Z",
  "file_hash": "ea7d2fac506335437c81b1c6ba9ec6769a1b82f2f81171371687412ce407ef83",
  "private": false,
  "record": {
    "abstract": "The Grover quantum search algorithm is generalized to deal with an arbitrary\nmixed initial state. The probability to measure a marked state as a function of\ntime is calculated, and found to depend strongly on the specific initial state.\nThe form of the function, though, remains as it is in the case of initial pure\nstate. We study the role of the von Neumann entropy of the initial state, and\nshow that the entropy cannot be a measure for the usefulness of the algorithm.\nWe give few examples and show that for some extremely mixed initial states\ncarrying high entropy, the generalized Grover algorithm is considerably faster\nthan any classical algorithm.",
    "arxiv_id": "quant-ph/0306183",
    "authors": [
      "Eli Biham",
      "Dan Kenigsberg"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.66.062301",
    "journal_ref": "Physical Review A 66:062301 (2002)",
    "title": "Grover\u0027s Quantum Search Algorithm for an Arbitrary Initial Mixed State",
    "url": "https://arxiv.org/abs/quant-ph/0306183"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "b2ba60cd-621c-4d0e-9f0e-6f60e7fc4ec4",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}