English
Related papers

Related papers: Enriched Categories for Parameterized Circuit Sema…

200 papers

These are lectures notes for a mini-course given at the conference Interactions of Quantum Affine Algebras with Cluster Algebras, Current Algebras, and Categorification in June 2018. The goal is to introduce the reader to string diagram…

Representation Theory · Mathematics 2022-04-27 Alistair Savage

Using the affine web category introduced in a prequel as a building block, we formulate a diagrammatic $\Bbbk$-linear monoidal category, the affine Schur category, for any commutative ring $\Bbbk$. We then formulate diagrammatic categories,…

Representation Theory · Mathematics 2024-12-25 Linliang Song , Weiqiang Wang

Bimonoidal categories (also known as rig categories) are categories with two monoidal structures, one of which distributes over the other. We formally define sheet diagrams, a graphical calculus for bimonoidal categories that was informally…

Category Theory · Mathematics 2020-12-22 Cole Comfort , Antonin Delpeuch , Jules Hedges

We prove a rectification theorem for enriched infinity-categories: If V is a nice monoidal model category, we show that the homotopy theory of infinity-categories enriched in V is equivalent to the familiar homotopy theory of categories…

Algebraic Topology · Mathematics 2020-11-03 Rune Haugseng

We introduce string diagrams as a formal mathematical, graphical language to represent, compose, program and reason about games. The language is well established in quantum physics, quantum computing and quantum linguistic with the…

Computer Science and Game Theory · Computer Science 2016-04-21 Jules Hedges , Evguenia Shprits , Viktor Winschel , Philipp Zahn

This is a draft of the textbook/monograph that presents computability theory using string diagrams. The introductory chapters have been taught as graduate and undergraduate courses and evolved through 8 years of lecture notes. The later…

Logic in Computer Science · Computer Science 2023-03-29 Dusko Pavlovic

The problem of learning a minimal consistent model from a set of labeled sequences of symbols is addressed from a satisfiability modulo theories perspective. We present two encodings for deterministic finite automata and extend one of these…

Formal Languages and Automata Theory · Computer Science 2017-05-31 Rick Smetsers

Diagrammatic reasoning using string diagrams provides an intuitive language for reasoning about morphisms in a symmetric monoidal category. To allow working with infinite families of string diagrams, !-graphs were introduced as a method to…

Logic in Computer Science · Computer Science 2015-11-06 David Quick

Path calculus, or graphical linear algebra, is a string diagram calculus for the category of matrices over a base ring. It is the usual string diagram calculus for a symmetric monoidal category, where the monoidal product is the direct sum…

Quantum Physics · Physics 2023-07-07 Simon Burton

In the current noisy intermediate-scale quantum (NISQ) era, quantum machine learning is emerging as a dominant paradigm to program gate-based quantum computers. In quantum machine learning, the gates of a quantum circuit are parametrized,…

Quantum Physics · Physics 2022-06-15 Osvaldo Simeone

We develop a notion of iterated monoidal category and show that this notion corresponds in a precise way to the notion of iterated loop space. Specifically the group completion of the nerve of such a category is an iterated loop space and…

Algebraic Topology · Mathematics 2007-05-23 C. Balteanu , Z. Fiedorowicz , R. Schwaenzl , R. Vogt

We show that observables in QED-type theories can be realized in terms of a combinatorial structure called chord diagrams. One advantage of this combinatorial representation is that it simplifies the study of the asymptotic behavior of…

High Energy Physics - Theory · Physics 2025-01-10 Ali Assem Mahmoud

Programs with a continuous state space or that interact with physical processes often require notions of equivalence going beyond the standard binary setting in which equivalence either holds or does not hold. In this paper we explore the…

Logic in Computer Science · Computer Science 2024-02-14 Fredrik Dahlqvist , Renato Neves

Framed combinatorial topology is a recent approach to tame geometry which expresses higher-dimensional stratified spaces via tractable combinatorial data. The resulting theory of spaces is well-behaved and computable. In this paper we…

Algebraic Topology · Mathematics 2023-05-11 Lukas Heidemann

Fong developed `decorated cospans' to model various kinds of open systems: that is, systems with inputs and outputs. In this framework, open systems are seen as the morphisms of a category and can be composed as such, allowing larger open…

Category Theory · Mathematics 2020-08-07 Kenny Courser

We prove that, under certain conditions, the model structure on a monoidal model category $\mathcal{V}$ can be transferred to a model structure on the category of $\mathcal{V}$-enriched coloured (symmetric) operads. As a particular case we…

Algebraic Topology · Mathematics 2014-01-28 Giovanni Caviglia

Coecke and Heunen described completely positive maps in dagger monoidal categories and the {\sf CP}-infinity construction on these categories in order to construct a category of arbitrary dimensional quantum processes. This article…

Category Theory · Mathematics 2023-06-27 Robin Cockett , Priyaa Varshinee Srinivasan

We verify that a certain functor $D\colon\text{Sp}^\Sigma(\text{Ch}^+)\to\text{Ch}$ is symmetric monoidal. This functor is used elsewhere in developing the model category theory of symmetric spectra and of chain complexes graded over…

Algebraic Topology · Mathematics 2020-01-22 Neil Strickland

Linear/non-linear (LNL) models, as described by Benton, soundly model a LNL term calculus and LNL logic closely related to intuitionistic linear logic. Every such model induces a canonical enrichment that we show soundly models a LNL lambda…

Logic in Computer Science · Computer Science 2019-06-25 Bert Lindenhovius , Michael Mislove , Vladimir Zamdzhiev

The aim of this thesis is to present an extension to the string graphs of Dixon, Duncan and Kissinger that allows the finite representation of certain infinite families of graphs and graph rewrite rules, and to demonstrate that a logic can…

Logic in Computer Science · Computer Science 2014-04-01 Alexander Merry
‹ Prev 1 8 9 10 Next ›