{
  "annotation_id": "5c3bd700-1f16-4447-8cfb-470a44614c23",
  "date_created": "2026-03-02T18:02:24.187000Z",
  "date_modified": "2026-03-02T18:02:24.187000Z",
  "file_hash": "29bd3b57db7768ebed1dd8ccb305990250a4d25e75eab9033682fe3fe7b2ca48",
  "private": false,
  "record": {
    "abstract": "The subject of this work is quantum predicative programming -- the study of\ndeveloping of programs intended for execution on a quantum computer. We look at\nprogramming in the context of formal methods of program development, or\nprogramming methodology. Our work is based on probabilistic predicative\nprogramming, a recent generalisation of the well-established predicative\nprogramming. It supports the style of program development in which each\nprogramming step is proven correct as it is made. We inherit the advantages of\nthe theory, such as its generality, simple treatment of recursive programs,\ntime and space complexity, and communication. Our theory of quantum programming\nprovides tools to write both classical and quantum specifications, develop\nquantum programs that implement these specifications, and reason about their\ncomparative time and space complexity all in the same framework.",
    "arxiv_id": "quant-ph/0602156",
    "authors": [
      "Anya Tafliovich",
      "E. C. R. Hehner"
    ],
    "categories": [
      "quant-ph",
      "cs.PL"
    ],
    "title": "Quantum Predicative Programming",
    "url": "https://arxiv.org/abs/quant-ph/0602156"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "2e32ca36-564b-4d4a-9b07-65fdcb7ed719",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}