Results 1 
7 of
7
Physical traces: Quantum vs. classical information processing
 In Proceedings of Category Theory and Computer Science 2002 (CTCS’02), volume 69 of Electronic Notes in Theoretical Computer Science. Elsevier Science
, 2003
"... a setting that enables qualitative differences between classical and quantum processes to be explored. The key construction is the physical interpretation/realization of the traced monoidal categories of finitedimensional vector spaces with tensor product as monoidal structure and of finite sets an ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
a setting that enables qualitative differences between classical and quantum processes to be explored. The key construction is the physical interpretation/realization of the traced monoidal categories of finitedimensional vector spaces with tensor product as monoidal structure and of finite sets and relations with Cartesian product as monoidal structure, both of them providing a socalled wavestyle GoI. The developments in this paper reveal that envisioning state update due to quantum measurement as a process provides a powerful tool for developing highlevel approaches to quantum information processing.
September 12, 2008 — Submitted to Trends in Logic VI The Logic BV and Quantum Causality
"... We describe how a logic with commutative and noncommutative connectives can be used for capturing the essence of discrete quantum causal propagation. 1 Causal graphs and locative slices In this note we describe how the kinematics of quantum causal evolution can be captured by the logic BV [2]. The s ..."
Abstract
 Add to MetaCart
We describe how a logic with commutative and noncommutative connectives can be used for capturing the essence of discrete quantum causal propagation. 1 Causal graphs and locative slices In this note we describe how the kinematics of quantum causal evolution can be captured by the logic BV [2]. The setting is discrete quantum mechanics. We imagine a finite “web ” of spacetime points. They are viewed as vertices in a directed acyclic graph (DAG); the edges of the DAG represent causal links mediated by the propagation of matter [1]. The fact that the graph is acyclic captures a basic causality requirement: there are no closed causal trajectories. The DAG represents a discrete approximation to the spacetime on which a quantum system evolves. The graph
Alogicalbasisforquantumevolutionand entanglement
, 2011
"... Abstract. We reconsider discrete quantum casual dynamics where quantum systems are viewed as discrete structures, namely directed acyclic graphs. In such a graph, events are considered as vertices and edges depict propagation between events. Evolution is described as happening between a special fami ..."
Abstract
 Add to MetaCart
Abstract. We reconsider discrete quantum casual dynamics where quantum systems are viewed as discrete structures, namely directed acyclic graphs. In such a graph, events are considered as vertices and edges depict propagation between events. Evolution is described as happening between a special family of spacelike slices, which were referred to as locative slices. Such slices are not so large as to result in acausal influences, but large enough to capture nonlocal correlations. In our logical interpretation, edges are assigned logical formulas in a special logical system, called BV, aninstanceofadeep inference system. WedemonstratethatBV, with its mix of commutative and noncommutative connectives, is precisely the right logic for such analysis. We show that the commutative tensor encodes (possible) entanglement, and the noncommutative seq encodes causal precedence. With this interpretation, the locative slices are precisely the derivable strings of formulas. 1.
Simulating Causal Wave Function Collapse Models
, 2004
"... We present simulations of causal dynamical wave function collapse models of field theories on a 1 + 1 null lattice. We use our simulations to compare and contrast two possible interpretations of the models, one in which the field values are real and the other in which the state vector is real. We su ..."
Abstract
 Add to MetaCart
We present simulations of causal dynamical wave function collapse models of field theories on a 1 + 1 null lattice. We use our simulations to compare and contrast two possible interpretations of the models, one in which the field values are real and the other in which the state vector is real. We suggest that a procedure of coarse graining and renormalising the fundamental field can overcome its noisiness and argue that this coarse grained renormalised field will show interesting structure if the state vector does on the coarse grained scale. We speculate on the implications for quantum gravity. a
Simulating Causal Collapse Models
, 2004
"... We present simulations of causal dynamical collapse models of field theories on a 1 + 1 null lattice. We use our simulations to compare and contrast two possible interpretations of the models, one in which the field values are real and the other in which the state vector is real. We suggest that a p ..."
Abstract
 Add to MetaCart
We present simulations of causal dynamical collapse models of field theories on a 1 + 1 null lattice. We use our simulations to compare and contrast two possible interpretations of the models, one in which the field values are real and the other in which the state vector is real. We suggest that a procedure of coarse graining and renormalising the fundamental field can overcome its noisiness and argue that this coarse grained renormalised field will show interesting structure if the state vector does on the coarse grained scale. a
Appl Categor Struct DOI 10.1007/s1048501092410 Deep Inference and Probabilistic Coherence Spaces
, 2009
"... Abstract This paper proposes a definition of categorical model of the deep inference system BV, defined by Guglielmi. Deep inference introduces the idea of performing a deduction in the interior of a formula, at any depth. Traditional sequent calculus rules only see the roots of formulae. However in ..."
Abstract
 Add to MetaCart
Abstract This paper proposes a definition of categorical model of the deep inference system BV, defined by Guglielmi. Deep inference introduces the idea of performing a deduction in the interior of a formula, at any depth. Traditional sequent calculus rules only see the roots of formulae. However in these new systems, one can rewrite at any position in the formula tree. Deep inference in particular allows the syntactic description of logics for which there is no sequent calculus. One such system is BV, which extends linear logic to include a noncommutative selfdual connective. This is the logic our paper proposes to model. Our definition is based on the notion of a linear functor, due to Cockett and Seely. A BVcategory is a linearly distributive