Related papers: Dagger linear logic and categorical quantum mechan…
We examine some combinatorial properties of parallel cut elimination in multiplicative linear logic (MLL) proof nets. We show that, provided we impose a constraint on some paths, we can bound the size of all the nets satisfying this…
With the development of quantum hardware bringing the error-corrected quantum circuits to the near future, the lack of an efficient polynomial-time decoding algorithms for logical circuits presents a critical bottleneck. While quantum…
In this paper, we consider characterisations of the class of unitary matrix integrals $\big\langle (\det U)^q {\rm e}^{s^{1/2} \operatorname{Tr}(U + U^\dagger)} \big\rangle_{U(l)}$ in terms of a first-order matrix linear differential…
This is the second in a series of papers intended to set up a framework to study categories of modules in the context of non-commutative geometries. In \cite{mem} we introduced the basic DG category $\Pc_{\A^\bullet}$, the perfect category…
A prototypical example of categorial grammars are those based on Lambek calculus, i.e. noncommutative intuitionistic linear logic. However, it has been noted that purely noncommutative operations are often not sufficient for modeling even…
The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of…
Dualities play a central role in the study of quantum spin chains, providing insight into the structure of quantum phase diagrams and phase transitions. In this work we study categorical dualities, which are defined as bounded-spread…
In this article the quantized matrix algebras as in the title have been studied at a root of unity. A full classification of simple modules over such quantized matrix algebras of rank $2$ along with a class of finite dimensional…
For a locally compact group $G$, we show that it is possible to present the class of continuous unitary representations of $G$ as an elementary class of metric structures, in the sense of continuous logic. More precisely, we show how…
We consider an extension of the modal logic of transitive closure K+ with some inifinitary derivations and present a sequent calculus for this extension, which allows non-well-founded proofs. For the given calculus, we obtain the…
We give a mathematical framework to describe the evolution of an open quantum systems subjected to finitely many interactions with classical apparatuses. The systems in question may be composed of distinct, spatially separated subsystems…
The coalgebraic $\mu$-calculus provides a generic semantic framework for fixpoint logics over systems whose branching type goes beyond the standard relational setup, e.g. probabilistic, weighted, or game-based. Previous work on the…
Coherence with respect to Kelly-Mac Lane graphs is proved for categories that correspond to the multiplicative fragment without constant propositions of classical linear first-order predicate logic without or with mix. To obtain this…
The growing demand for large-scale quantum computers is pushing research on Distributed Quantum Computing (DQC). Recent experimental efforts have demonstrated some of the building blocks for such a design. DQC systems are clusters of…
We revise the construction of the augmented Cuntz semigroup functor used by the first author to classify inductive limits of 1-dimensional noncommutative CW complexes. The original construction has good functorial properties when restricted…
Mutually unbiased bases (MUBs) and symmetric informationally complete projectors (SICs) are crucial to many conceptual and practical aspects of quantum theory. Here, we develop their role in quantum nonlocality by: i) introducing families…
Q-systems are unitary versions of Frobenius algebra objects which appeared in the theory of subfactors. In recent joint work with R. Hern\'andez Palomares and C. Jones, the authors defined a notion of Q-system completion for C*/W*…
Dynamic logic is a powerful framework for reasoning about imperative programs. An extension with a concurrent operator [18] was introduced to formalise programs running in parallel. In other direction, other authors proposed a systematic…
A number of models of linear logic are based on or closely related to linear algebra, in the sense that morphisms are "matrices" over appropriate coefficient sets. Examples include models based on coherence spaces, finiteness spaces and…
The multipullback quantization of complex projective spaces lacks the naive quantum CW-complex structure because the quantization of an embedding of the $n$-skeleton into the $(n+1)$-skeleton does not exist. To overcome this difficulty, we…