{
  "annotation_id": "376b1d29-1293-4ba8-a9ac-41c5e82172ec",
  "date_created": "2026-03-02T18:02:06.282000Z",
  "date_modified": "2026-03-02T18:02:06.282000Z",
  "file_hash": "841ec4d56b4d0845781c711897388ee22346add15d25b59d078a21e59cf1bc4e",
  "private": false,
  "record": {
    "abstract": "We study computation of the mean of sequences with values in finite\ndimensional normed spaces and compare the computational power of classical\nrandomized with that of quantum algorithms for this problem. It turns out that\nin contrast to the known superiority of quantum algorithms in the scalar case,\nin high dimensional $L_p^M$ spaces classical randomized algorithms are\nessentially as powerful as quantum algorithms.",
    "arxiv_id": "quant-ph/0403109",
    "authors": [
      "Stefan Heinrich"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "On the Power of Quantum Algorithms for Vector Valued Mean Computation",
    "url": "https://arxiv.org/abs/quant-ph/0403109"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "c4c67fdc-4825-4203-9e79-2e874856b039",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}