Related papers: Sum and Tensor of Quantitative Effects
We study a physically motivated representation of an algebra of operators in gravitational and non gravitational theories called the covariant representation of an algebra. This is a representation where the symmetries of the operator…
In this note, we study various relational and algebraic aspects of the bounded quasi-implication algebras introduced by Hardegree. By generalizing the constructions given by MacLaren and Goldblatt within the setting of ortholattices, we…
Monads in category theory are algebraic structures that can be used to model computational effects in programming languages. We show how the notion of "centre", and more generally "centrality", i.e. the property for an effect to commute…
Let G be a group and let A be the algebra of complex functions on G with finite support. The product in G gives rise to a coproduct on A making it a multiplier Hopf algebra. In fact, because there exist integrals, we get an algebraic…
Recently\cite{BQG}, it was shown that quantum effects of matter could be identified with the conformal degree of freedom of the space-time metric. Accordingly, one can introduce quantum effects either by making a scale transformation (i.e.…
We show that the model of quantum computation based on density matrices and superoperators can be decomposed in a pure classical (functional) part and an effectful part modeling probabilities and measurement. The effectful part can be…
This thesis proposes a combinatorial generalization of a nilpotent operator on a vector space. The resulting object is highly natural, with basic connections to a variety of fields in pure mathematics, engineering, and the sciences. For the…
In computer science, especially when dealing with quantum computing or other non-standard models of computation, basic notions in probability theory like "a predicate" vary wildly. There seems to be one constant: the only useful example of…
We give a categorical semantics for a call-by-value linear lambda calculus. Such a lambda calculus was used by Selinger and Valiron as the backbone of a functional programming language for quantum computation. One feature of this lambda…
Following a recent proposal of Richard Borcherds to regard fusion as the ring-like tensor product of modules of a {\em quantum ring}, a generalization of rings and vertex operators, we define fusion as a certain quotient of the (vector…
In these notes we present preliminary results on quantum-like algorithms where tensor product is replaced by geometric product. Such algorithms possess the essential properties typical of quantum computation (entanglement, parallelism) but…
In this paper we consider Idempotent Functional Analysis, an `abstract' version of Idempotent Analysis developed by V. P. Maslov and his collaborators. We give a review of the basic ideas of Idempotent Analysis. The correspondence between…
We introduce a general theory of quantitative and metric rewriting systems, namely systems with a rewriting relation enriched over quantales modelling abstract quantities. We develop theories of abstract and term-based systems, refining…
We generalize the tensor product theory for modules for a vertex operator algebra previously developed in a series of papers by the first two authors to suitable module categories for a ``conformal vertex algebra'' or even more generally,…
We expand on the remark by Andrews on the importance of infinite sums and products in combinatorics. Let $\{g_d(n)\}_{d\geq 0,n \geq 1}$ be the double sequences $\sigma_d(n)= \sum_{\ell \mid n} \ell^d$ or $\psi_d(n)= n^d$. We associate…
We develop universal algebra over an enriched category $\mathcal K$ and relate it to finitary enriched monads over $\mathcal K$. Using it, we deduce recent results about ordered universal algebra where inequations are used instead of…
In recent three--loop calculations of massive Feynman integrals within Quantum Chromodynamics (QCD) and, e.g., in recent combinatorial problems the so-called generalized harmonic sums (in short $S$-sums) arise. They are characterized by…
Monads are a useful tool for structuring effectful features of computation such as state, non-determinism, and continuations. In the last decade, several generalisations of monads have been suggested which provide a more fine-grained model…
In this paper we present 'Quantum Model Theory' (QMod), a theory we developed to model entities that entail the typical quantum effects of 'contextuality', 'superposition', 'interference', 'entanglement' and 'emergence'. The aim of QMod is…
Mixed-effects models are fundamental tools for analyzing clustered and repeated-measures data, but existing high-dimensional methods largely focus on penalized estimation with vector-valued covariates. Bayesian alternatives in this regime…