47,336 research outputs found
Functorial Semantics for Petri Nets under the Individual Token Philosophy
Although the algebraic semantics of place/transition Petri nets under the collective token philosophy has been fully explained in terms of (strictly) symmetric (strict) monoidal categories, the analogous construction under the individual token philosophy is not completely satisfactory because it lacks universality and also functoriality. We introduce the notion of pre-net to recover these aspects, obtaining a fully satisfactory categorical treatment centered on the notion of adjunction. This allows us to present a purely logical description of net behaviours under the individual token philosophy in terms of theories and theory morphisms in partial membership equational logic, yielding a complete match with the theory developed by the authors for the collective token view of net
Quantum Picturalism
The quantum mechanical formalism doesn't support our intuition, nor does it
elucidate the key concepts that govern the behaviour of the entities that are
subject to the laws of quantum physics. The arrays of complex numbers are kin
to the arrays of 0s and 1s of the early days of computer programming practice.
In this review we present steps towards a diagrammatic `high-level' alternative
for the Hilbert space formalism, one which appeals to our intuition. It allows
for intuitive reasoning about interacting quantum systems, and trivialises many
otherwise involved and tedious computations. It clearly exposes limitations
such as the no-cloning theorem, and phenomena such as quantum teleportation. As
a logic, it supports `automation'. It allows for a wider variety of underlying
theories, and can be easily modified, having the potential to provide the
required step-stone towards a deeper conceptual understanding of quantum
theory, as well as its unification with other physical theories. Specific
applications discussed here are purely diagrammatic proofs of several quantum
computational schemes, as well as an analysis of the structural origin of
quantum non-locality. The underlying mathematical foundation of this high-level
diagrammatic formalism relies on so-called monoidal categories, a product of a
fairly recent development in mathematics. These monoidal categories do not only
provide a natural foundation for physical theories, but also for proof theory,
logic, programming languages, biology, cooking, ... The challenge is to
discover the necessary additional pieces of structure that allow us to predict
genuine quantum phenomena.Comment: Commissioned paper for Contemporary Physics, 31 pages, 84 pictures,
some colo
Towards an embedding of Graph Transformation in Intuitionistic Linear Logic
Linear logics have been shown to be able to embed both rewriting-based
approaches and process calculi in a single, declarative framework. In this
paper we are exploring the embedding of double-pushout graph transformations
into quantified linear logic, leading to a Curry-Howard style isomorphism
between graphs and transformations on one hand, formulas and proof terms on the
other. With linear implication representing rules and reachability of graphs,
and the tensor modelling parallel composition of graphs and transformations, we
obtain a language able to encode graph transformation systems and their
computations as well as reason about their properties
Process Realizability
We develop a notion of realizability for Classical Linear Logic based on a
concurrent process calculus.Comment: Appeared in Foundations of Secure Computation: Proceedings of the
1999 Marktoberdorf Summer School, F. L. Bauer and R. Steinbruggen, eds. (IOS
Press) 2000, 167-18
Finitary Topos for Locally Finite, Causal and Quantal Vacuum Einstein Gravity
Previous work on applications of Abstract Differential Geometry (ADG) to
discrete Lorentzian quantum gravity is brought to its categorical climax by
organizing the curved finitary spacetime sheaves of quantum causal sets
involved therein, on which a finitary (:locally finite), singularity-free,
background manifold independent and geometrically prequantized version of the
gravitational vacuum Einstein field equations were seen to hold, into a topos
structure. This topos is seen to be a finitary instance of both an elementary
and a Grothendieck topos, generalizing in a differential geometric setting, as
befits ADG, Sorkin's finitary substitutes of continuous spacetime topologies.
The paper closes with a thorough discussion of four future routes we could take
in order to further develop our topos-theoretic perspective on ADG-gravity
along certain categorical trends in current quantum gravity research.Comment: 49 pages, latest updated version (errata corrected, references
polished) Submitted to the International Journal of Theoretical Physic
A Comparison of Petri Net Semantics under the Collective Token Philosophy
In recent years, several semantics for place/transition Petri nets have been proposed that adopt the collective token philosophy. We investigate distinctions and similarities between three such models, namely configuration structures, concurrent transition systems, and (strictly) symmetric (strict) monoidal categories. We use the notion of adjunction to express each connection. We also present a purely logical description of the collective token interpretation of net behaviours in terms of theories and theory morphisms in partial membership equational logic
An Algebraic Approach to Linear-Optical Schemes for Deterministic Quantum Computing
Linear-Optical Passive (LOP) devices and photon counters are sufficient to
implement universal quantum computation with single photons, and particular
schemes have already been proposed. In this paper we discuss the link between
the algebraic structure of LOP transformations and quantum computing. We first
show how to decompose the Fock space of N optical modes in finite-dimensional
subspaces that are suitable for encoding strings of qubits and invariant under
LOP transformations (these subspaces are related to the spaces of irreducible
unitary representations of U(N)). Next we show how to design in algorithmic
fashion
LOP circuits which implement any quantum circuit deterministically. We also
present some simple examples, such as the circuits implementing a CNOT gate and
a Bell-State Generator/Analyzer.Comment: new version with minor modification
- …