{
  "annotation_id": "1bc4a4c7-fd7f-4cfe-b9fc-da835a30a41c",
  "date_created": "2026-03-02T18:01:49.260000Z",
  "date_modified": "2026-03-02T18:01:49.260000Z",
  "file_hash": "f75ebbfb515abbef8a175a850dcd648981c2cd824790085bfe2f22beaab354d2",
  "private": false,
  "record": {
    "abstract": "We propose an ensemble algorithm, which provides a new approach for\nevaluating and summing up a set of function samples. The proposed algorithm is\nnot a quantum algorithm, insofar it does not involve quantum entanglement. The\nquery complexity of the algorithm depends only on the scaling of the\nmeasurement sensitivity with the number of distinct spin sub-ensembles. From a\npractical point of view, the proposed algorithm may result in an exponential\nspeedup, compared to known quantum and classical summing algorithms. However in\ngeneral, this advantage exists only if the total number of function samples is\nbelow a threshold value which depends on the measurement sensitivity.",
    "arxiv_id": "quant-ph/0202142",
    "authors": [
      "C. D\u0027Helon",
      "V. Protopopescu"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1088/0305-4470/35/42/102",
    "journal_ref": "Journal of Physics A, 35(42), L597, 2002",
    "title": "New summing algorithm using ensemble computing",
    "url": "https://arxiv.org/abs/quant-ph/0202142"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "43100595-c815-444e-babc-fdc9320f4da4",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}