{
  "annotation_id": "0836cdbb-a3f0-4f20-a839-3be3e2ad81c5",
  "date_created": "2026-03-02T18:02:10.070000Z",
  "date_modified": "2026-03-02T18:02:10.070000Z",
  "file_hash": "248f1a0c134286a2fb0cdbada5a38b7778de992a84c4fb3607d383726dba5d7b",
  "private": false,
  "record": {
    "abstract": "We introduce the language QML, a functional language for quantum computations\non finite types. Its design is guided by its categorical semantics: QML\nprograms are interpreted by morphisms in the category FQC of finite quantum\ncomputations, which provides a constructive semantics of irreversible quantum\ncomputations realisable as quantum gates. QML integrates reversible and\nirreversible quantum computations in one language, using first order strict\nlinear logic to make weakenings explicit. Strict programs are free from\ndecoherence and hence preserve superpositions and entanglement - which is\nessential for quantum parallelism.",
    "arxiv_id": "quant-ph/0409065",
    "authors": [
      "Thorsten Altenkirch",
      "Jonathan Grattage"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1109/LICS.2005.1",
    "journal_ref": "Logic in Computer Science, 2005. Proceedings. 20th Annual IEEE\n  Symposium on, 26-29 June 2005 Page(s):249 - 258",
    "title": "A functional quantum programming language",
    "url": "https://arxiv.org/abs/quant-ph/0409065"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "e0d22680-c49c-485b-93b0-63c7cb7d49dd",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}