{
  "annotation_id": "20193848-644d-44f9-8a62-687744a42e69",
  "date_created": "2026-03-02T18:02:41.707000Z",
  "date_modified": "2026-03-02T18:02:41.707000Z",
  "file_hash": "66b1ee5c2b2c18296f5ba027b3ac924c2ba2a59d6a70e7a66591257d735ba2d1",
  "private": false,
  "record": {
    "abstract": "Classical programming languages cannot model essential elements of complex\nsystems such as true random number generation. This paper develops a formal\nprogramming language called the lambda-q calculus that addresses the\nfundamental properties of complex systems. This formal language allows the\nexpression of quantumized algorithms, which are extensions of randomized\nalgorithms in that probabilities can be negative, and events can cancel out. An\nillustration of the power of quantumized algorithms is the ability to\nefficiently solve the satisfiability problem, something that many believe is\nbeyond the capability of classical computers. This paper proves that the\nlambda-q calculus is not only capable of solving satisfiability but can also\nsimulate such complex systems as quantum computers. Since satisfiability is\nbelieved to be beyond the capabilities of quantum computers, the lambda-q\ncalculus may be strictly stronger.",
    "arxiv_id": "quant-ph/9710035",
    "authors": [
      "Philip Maymin"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Programming Complex Systems",
    "url": "https://arxiv.org/abs/quant-ph/9710035"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "0477bbf5-a0b9-41ee-a92c-1fdb85e7a01f",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}