Total and partial computation in categorical quantum foundations

zbMATH Open1477.81028arXiv1511.01569MaRDI QIDQ5015192FDOQ5015192

Authors: Kenta Cho 

Publication date: 6 December 2021

Abstract: This paper uncovers the fundamental relationship between total and partial computation in the form of an equivalence of certain categories. This equivalence involves on the one hand effectuses, which are categories for total computation, introduced by Jacobs for the study of quantum/effect logic. On the other hand, it involves what we call FinPACs with effects; they are finitely partially additive categories equipped with effect algebra structures, serving as categories for partial computation. It turns out that the Kleisli category of the lift monad (-)+1 on an effectus is always a FinPAC with effects, and this construction gives rise to the equivalence. Additionally, state-and-effect triangles over FinPACs with effects are presented.

Full work available at URL: https://arxiv.org/abs/1511.01569

Recommendations

• Effectuses from monads
• From probability monads to commutative effectuses
• scientific article; zbMATH DE number 4047721
• Quantum Programs as Kleisli Maps
• Categorical equivalence between orthomodular dynamic algebras and complete orthomodular lattices

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15) Eilenberg-Moore and Kleisli constructions for monads (18C20)

Cites Work

• Coreflections in algebraic quantum logic
• Title not available (Why is that?)
• Notions of computation and monads
• Towards a quantum domain theory: order-enrichment and fixpoints in \(W^*\)-algebras
• Dijkstra Monads in Monadic Computation
• New directions in categorical logic, for classical, probabilistic and quantum logic
• States of convex sets
• Partially additive categories and flow-diagram semantics
• Semantics for a quantum programming language by operator algebras
• Quotient-comprehension chains

Cited In (9)

• A computer scientist’s reconstruction of quantum theory*
• A type theory for probabilistic and Bayesian reasoning
• A modular functor which is universal for quantum computation
• Extending Graphical Representations for Compact Closed Categories with Applications to Symbolic Quantum Computation
• Dichotomy between deterministic and probabilistic models in countably additive effectus theory
• From probability monads to commutative effectuses
• Effectuses from monads
• Quotient-comprehension chains
• Category-theoretic analysis of the notion of complementarity for quantum systems

This page was built for publication: Total and partial computation in categorical quantum foundations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015192)