Categories of quantum cpos
<|reference_start|>Categories of quantum cpos: This paper unites two research lines. The first involves finding categorical models of quantum programming languages 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. 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. For this reason, quantum cpos may form the backbone of a future quantum domain theory.<|reference_end|>
@article{kornell2024categories,
    title={Categories of quantum cpos},
    author={Andre Kornell, Bert Lindenhovius, Michael Mislove},
    journal={arXiv preprint arXiv:2406.01816},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.01816},
    primaryClass={math-ph cs.LO math.CT math.MP math.OA quant-ph}
}