{
  "annotation_id": "80450777-826d-43dc-b8c1-d9c32b208356",
  "date_created": "2026-03-02T18:01:48.953000Z",
  "date_modified": "2026-03-02T18:01:48.953000Z",
  "file_hash": "84f0b37c1606f2809f44ab20c51ae70ba54958633e0357728918867359e0c897",
  "private": false,
  "record": {
    "abstract": "The translation of Grover\u0027s search algorithm from its standard version,\ndesigned for implementation on a single quantum system amenable to projective\nmeasurements, into one suitable for an ensemble of quantum computers, whose\noutputs are expectation values of observables, is described in detail. A\nfiltering scheme, which effectively determines expectation values on a limited\nportion of the quantum state, is presented and used to locate a single item for\nsearches involving more than one marked item. A truncated version of Grover\u0027s\nalgorithm, requiring fewer steps than the translated standard version but\nlocating marked items just as successfully, is proposed. For quantum\ncomputational devices which only return expectation values, the truncated\nversion is superior to its standard counterpart. This indicates that it is\npossible to modify quantum algorithms so as to reduce the required temporal\nresources by using the ensemble\u0027s spatial resources.",
    "arxiv_id": "quant-ph/0111108",
    "authors": [
      "David Collins"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.65.052321",
    "title": "Modified Grover\u0027s algorithm for an expectation value quantum computer",
    "url": "https://arxiv.org/abs/quant-ph/0111108"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "088f0139-3363-4814-9e02-91c92a833f7d",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}