Categories of quantum cpos

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Kornell, Andre, Lindenhovius, Bert, Mislove, Michael
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866911612186656768
author Kornell, Andre
Lindenhovius, Bert
Mislove, Michael
author_facet Kornell, Andre
Lindenhovius, Bert
Mislove, Michael
contents 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 $ω$-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.
format Preprint
id arxiv_https___arxiv_org_abs_2406_01816
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Categories of quantum cpos
Kornell, Andre
Lindenhovius, Bert
Mislove, Michael
Mathematical Physics
Logic in Computer Science
Category Theory
Operator Algebras
Quantum Physics
47L90, 47L05, 46L89, 18C50, 06B35, 18M05, 18M40, 68N15, 68Q55, 81P68
F.3.2
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 $ω$-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.
title Categories of quantum cpos
topic Mathematical Physics
Logic in Computer Science
Category Theory
Operator Algebras
Quantum Physics
47L90, 47L05, 46L89, 18C50, 06B35, 18M05, 18M40, 68N15, 68Q55, 81P68
F.3.2
url https://arxiv.org/abs/2406.01816