Hostname: page-component-6766d58669-bp2c4 Total loading time: 0 Render date: 2026-05-15T01:27:39.719Z Has data issue: false hasContentIssue false

Categories of quantum cpos

Published online by Cambridge University Press:  20 April 2026

Andre Kornell
Affiliation:
Department of Computer Science, Tulane University , New Orleans, USA
Bert Lindenhovius
Affiliation:
Institute for Mathematical Methods in Medicine and Data Based Modeling, Johannes Kepler University Linz, Austria
Michael Mislove*
Affiliation:
Department of Computer Science, Tulane University , New Orleans, USA Department of Mathematics, Tulane University, USA
*
Corresponding author: Michael Mislove; Email: mislove@tulane.edu
Rights & Permissions [Opens in a new window]

Abstract

This paper unites two research lines. The first involves finding categorical models of quantum programming languages with recursion and their type systems. The second line concerns the program of quantization of mathematical structures, which amounts to finding noncommutative generalizations (also called quantum generalizations) of these structures. Using a quantization method called discrete quantization, which essentially amounts to the internalization of structures in a category of von Neumann algebras and quantum relations, we find a noncommutative generalization of $\omega$-complete partial orders (cpos), called quantum cpos. Cpos are central in domain theory and are widely used to construct categorical models of programming languages with recursion. We show that quantum cpos have similar categorical properties to cpos and are therefore suitable for the construction of categorical models for quantum programming languages, which is illustrated with some examples. Because of their noncommutative character, quantum cpos may form the backbone of a future quantum domain theory that provides structural methods for the denotational semantics of recursive quantum programming languages.

Information

Type
Paper
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
Copyright
© The Author(s), 2026. Published by Cambridge University Press