{
  "annotation_id": "a77cd2b3-87f8-40fe-8804-30a0751a5041",
  "date_created": "2026-03-02T18:02:44.644000Z",
  "date_modified": "2026-03-02T18:02:44.644000Z",
  "file_hash": "f1e5c319dedda8896d26b5beede4f5b89c980d0cb4a811bc9f6cce45204d7244",
  "private": false,
  "record": {
    "abstract": "Grover\u0027s search algorithm is designed to be executed on a quantum mechanical\ncomputer. In this paper, the probabilistic wp-calculus is used to model and\nreason about Grover\u0027s algorithm. It is demonstrated that the calculus provides\na rigorous programming notation for modelling this and other quantum algorithms\nand that it also provides a systematic framework of analysing such algorithms.",
    "arxiv_id": "quant-ph/9810066",
    "authors": [
      "Michael Butler",
      "Pieter Hartel"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Reasoning about Grover\u0027s Quantum Search Algorithm using Probabilistic wp",
    "url": "https://arxiv.org/abs/quant-ph/9810066"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "cc7791f0-5a90-4eba-89ba-ca81a25e7997",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}