Related papers: A Functorial Perspective on (Multi)computational I…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
We adapt previous research on category theory and topological unsupervised learning to develop a functorial perspective on manifold learning, also known as nonlinear dimensionality reduction. We first characterize manifold learning…
In [arXiv:1509.02937], the notion of a module tensor category was introduced as a braided monoidal central functor $F\colon \mathcal{V}\longrightarrow \mathcal{T}$ from a braided monoidal category $\mathcal{V}$ to a monoidal category…
Traced monoidal categories are used to model processes that can feed their outputs back to their own inputs, abstracting iteration. The category of finite dimensional Hilbert spaces with the direct sum tensor is not traced. But…
We study a number of categorical quasi-uniform structures induced by functors. We depart from a category $\mathcal{C}$ with a proper $(\mathcal{E}, \mathcal{M})$-factorization system, then define the continuity of a $\mathcal{C}$-morphism…
In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…
A great part of the mathematical foundations of topological quantum computation is given by the theory of modular categories which provides a description of the topological phases of matter such as anyon systems. In the near future the…
We prove coherence theorems for dualizable objects in monoidal bicategories and for fully dualizable objects in symmetric monoidal bicategories, describing coherent dual pairs and coherent fully dual pairs. These are property-like…
This paper charts a very direct path between the categorical approach to quantum mechanics, due to Abramsky and Coecke, and the older convex-operational approach based on ordered vector spaces (recently reincarnated as "generalized…
We present a method of constructing monoidal, braided monoidal, and symmetric monoidal bicategories from corresponding types of monoidal double categories that satisfy a lifting condition. Many important monoidal bicategories arise…
We define a monoidal semantics for algebraic theories. The basis for the definition is provided by the analysis of the structural rules in the term calculus of algebraic languages. Models are described both explicitly, in a form that…
In his article "Powerlist: A Structure for Parallel Recursion" Jayadev Misra wrote: "Many data parallel algorithms Fast Fourier Transform, Batcher's sorting schemes and prefix sum -exhibit recursive structure. We propose a data structure,…
In Monoidal Computer I, we introduced a categorical model of computation where the formal reasoning about computability was supported by the simple and popular diagrammatic language of string diagrams. In the present paper, we refine and…
We show that morphisms from n A_infinity-algebras to a single one are maps over an operad module with n+1 commuting actions of the operad A_infinity, whose algebras are conventional A_infinity-algebras. Similar statement holds for homotopy…
The inclusion of the unit in a braided tensor category $\mathcal{V}$ induces a 1-morphism in the Morita 4-category of braided tensor categories $BrTens$. We give criteria for the dualizability of this morphism. When $\mathcal{V}$ is a…
We discuss what it means for a symmetric monoidal category to be a module over a commutative semiring category. Each of the categories of (1) cartesian monoidal categories, (2) semiadditive categories, and (3) connective spectra can be…
Rewriting systems are often defined as binary relations over a given set of objects. This simple definition is used to describe various properties of rewriting such as termination, confluence, normal forms etc. In this paper, we introduce a…
Quantum computation can be formulated through various models, each highlighting distinct structural and resource-theoretic aspects of quantum computational power. This paper develops a unified categorical framework that encompasses these…
In arXiv:2011.03313, the author has constructed a category of abstractly automorphic representations for $\mathrm{GL}(2)$ over a function field $F$. This is a symmetric monoidal Abelian category, constructed with the goal of having the…
In the past four decades, the notion of quantum polynomial-time computability has been mathematically modeled by quantum Turing machines as well as quantum circuits. This paper seeks the third model, which is a quantum analogue of the…