POVMs and Naimark's theorem without sums

We provide a definition of POVM in terms of abstract tensor structure only. It is justified in two distinct manners. i. At this abstract level we are still able to prove Naimark's theorem, hence establishing a bijective correspondence between abstract POVMs and abstract projective measurements on an extended system, and this proof is moreover purely graphical. ii. Our definition coincides with the usual one for the particular case of the Hilbert space tensor product. We also point to a very useful normal form result for the classical object structure introduced in quant-ph/0608035

The dagger lambda calculus

We present a novel lambda calculus that casts the categorical approach to the study of quantum protocols into the rich and well established tradition of type theory. Our construction extends the linear typed lambda calculus with a linear negation of "trivialised" De Morgan duality. Reduction is realised through explicit substitution, based on a symmetric notion of binding of global scope, with rules acting on the entire typing judgement instead of on a specific subterm. Proofs of subject reduction, confluence, strong normalisation and consistency are provided, and the language is shown to be an internal language for dagger compact categories.Comment: In Proceedings QPL 2014, arXiv:1412.810

Turing Automata and Graph Machines

Indexed monoidal algebras are introduced as an equivalent structure for self-dual compact closed categories, and a coherence theorem is proved for the category of such algebras. Turing automata and Turing graph machines are defined by generalizing the classical Turing machine concept, so that the collection of such machines becomes an indexed monoidal algebra. On the analogy of the von Neumann data-flow computer architecture, Turing graph machines are proposed as potentially reversible low-level universal computational devices, and a truly reversible molecular size hardware model is presented as an example

An embedding theorem for Hilbert categories

We axiomatically define (pre-)Hilbert categories. The axioms resemble those for monoidal Abelian categories with the addition of an involutive functor. We then prove embedding theorems: any locally small pre-Hilbert category whose monoidal unit is a simple generator embeds (weakly) monoidally into the category of pre-Hilbert spaces and adjointable maps, preserving adjoint morphisms and all finite (co)limits. An intermediate result that is important in its own right is that the scalars in such a category necessarily form an involutive field. In case of a Hilbert category, the embedding extends to the category of Hilbert spaces and continuous linear maps. The axioms for (pre-)Hilbert categories are weaker than the axioms found in other approaches to axiomatizing 2-Hilbert spaces. Neither enrichment nor a complex base field is presupposed. A comparison to other approaches will be made in the introduction.Comment: 24 page

The game semantics of game theory

We use a reformulation of compositional game theory to reunite game theory with game semantics, by viewing an open game as the System and its choice of contexts as the Environment. Specifically, the system is jointly controlled by $n \geq 0$ noncooperative players, each independently optimising a real-valued payoff. The goal of the system is to play a Nash equilibrium, and the goal of the environment is to prevent it. The key to this is the realisation that lenses (from functional programming) form a dialectica category, which have an existing game-semantic interpretation. In the second half of this paper, we apply these ideas to build a compact closed category of `computable open games' by replacing the underlying dialectica category with a wave-style geometry of interaction category, specifically the Int-construction applied to the cartesian monoidal category of directed-complete partial orders