SearcharxivSearch

arXiv subjects

Robert Furber

Publications and source records attributed to Robert Furber.

7 recordsLinked to original sources

Interpreting Lambda Calculus in Domain-Valued Random Variables

We develop Boolean-valued domain theory and show how the lambda-calculus can be interpreted in using domain-valued random variables. We focus on the reflexive domain construction rather than the language and its semantics. The notion of equality has to be interpreted in the Boolean algebra and when we say that an equation is valid in the model we mean that its interpretation is the top element of the Boolean algebra.

cs.LO

Scott Continuity in Generalized Probabilistic Theories

Scott continuity is a concept from domain theory that had an unexpected previous life in the theory of von Neumann algebras. Scott-continuous states are known as normal states, and normal states are exactly the states coming from density matrices. Given this, and the usefulness of Scott continuity in domain theory, it is natural to ask whether this carries over to generalized probabilistic theories. We show that the answer is no - there are infinite-dimensional convex sets for which the set of Scott-continuous states on the corresponding set of 2-valued POVMs does not recover the original convex set, but is strictly larger. This shows the necessity of the use of topologies for state-effect duality in the general case, rather than purely order theoretic notions.

cs.LO

Probabilistic logics based on Riesz spaces

We introduce a novel real-valued endogenous logic for expressing properties of probabilistic transition systems called Riesz modal logic. The design of the syntax and semantics of this logic is directly inspired by the theory of Riesz spaces, a mature field of mathematics at the intersection of universal algebra and functional analysis. By using powerful results from this theory, we develop the duality theory of the Riesz modal logic in the form of an algebra-to-coalgebra correspondence. This has a number of consequences including: a sound and complete axiomatization, the proof that the logic characterizes probabilistic bisimulation and other convenient results such as completion theorems. This work is intended to be the basis for subsequent research on extensions of Riesz modal logic with fixed-point operators.

cs.LO

Categorical Equivalences from State-Effect Adjunctions

From every pair of adjoint functors it is possible to produce a (possibly trivial) equivalence of categories by restricting to the subcategories where the unit and counit are isomorphisms. If we do this for the adjunction between effect algebras and abstract convex sets, we get the surprising result that the equivalent subcategories consist of reflexive order-unit spaces and reflexive base-norm spaces, respectively. These are the convex sets that can occur as state spaces in generalized probabilistic theories satisfying both the no-restriction hypothesis and its dual. The linearity of the morphisms is automatic. If we add a compact topology to either the states or the effects, we can obtain a duality for all Banach order-unit spaces or all Banach base-norm spaces, but not both at the same time.

cs.LO

Towards a Categorical Account of Conditional Probability

This paper presents a categorical account of conditional probability, covering both the classical and the quantum case. Classical conditional probabilities are expressed as a certain "triangle-fill-in" condition, connecting marginal and joint probabilities, in the Kleisli category of the distribution monad. The conditional probabilities are induced by a map together with a predicate (the condition). The latter is a predicate in the logic of effect modules on this Kleisli category. This same approach can be transferred to the category of C*-algebras (with positive unital maps), whose predicate logic is also expressed in terms of effect modules. Conditional probabilities can again be expressed via a triangle-fill-in property. In the literature, there are several proposals for what quantum conditional probability should be, and also there are extra difficulties not present in the classical case. At this stage, we only describe quantum systems with classical parametrization.

math.CT

Unordered Tuples in Quantum Computation

It is well known that the C*-algebra of an ordered pair of qubits is M_2 (x) M_2. What about unordered pairs? We show in detail that M_3 (+) C is the C*-algebra of an unordered pair of qubits. Then we use Schur-Weyl duality to characterize the C*-algebra of an unordered n-tuple of d-level quantum systems. Using some further elementary representation theory and number theory, we characterize the quantum cycles. We finish with a characterization of the von Neumann algebra for unordered words.

math.QA