{
  "annotation_id": "e591c2b0-5ebf-4d87-8d39-75f67a140411",
  "date_created": "2026-03-02T18:02:48.539000Z",
  "date_modified": "2026-03-02T18:02:48.539000Z",
  "file_hash": "a6dea6496c15ca136ac0f57e256c4b81d3ffcff4cb6e9f05e00a1f0ea4cb856e",
  "private": false,
  "record": {
    "abstract": "This paper extends the quantum search class of algorithms to the multiple\nsolution case. It is shown that, like the basic search algorithm, these too can\nbe represented as a rotation in an appropriately defined two dimensional vector\nspace. This yields new applications - an algorithm is presented that can create\nan arbitrarily specified quantum superposition on a space of size N in\nO(sqrt(N)) steps. By making a measurement on this superposition, it is possible\nto obtain a sample according to an arbitrarily specified classical probability\ndistribution in O(sqrt(N)) steps. A classical algorithm would need O(N) steps.",
    "arxiv_id": "quant-ph/9912001",
    "authors": [
      "Lov K. Grover"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Rapid sampling through quantum computing",
    "url": "https://arxiv.org/abs/quant-ph/9912001"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "df865e24-cfbd-4f73-a030-7e70d75baf6c",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}