Related papers: On quantum computation, anyons, and categories
We discuss the connection between anyons (particles with fractional statistics) and deformed Lie algebras (quantum groups). After a brief review of the main properties of anyons, we present the details of the anyonic realization of all…
We give a rough description of the 'categories' formed by quantum field theories. A few recent mathematical conjectures derived from quantum field theories, some of which are now proven theorems, will be presented in this language.
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…
These are expanded lecture notes from lectures given at the Workshop on higher structures at MATRIX Melbourne. These notes give an introduction to Feynman categories and their applications. Feynman categories give a universal categorical…
Compactons are solutions of the equations of motion that behave trivially outside a compact region. In general, the operators describing quantum fluctuations above compactons have singularities. However, we show that despite these…
A universal quantum computer can be constructed using abelian anyons. Two qubit quantum logic gates such as controlled-NOT operations are performed using topological effects. Single-anyon operations such as hopping from site to site on a…
We consider a two-dimensional spin system that exhibits abelian anyonic excitations. Manipulations of these excitations enable the construction of a quantum computational model. While the one-qubit gates are performed dynamically the model…
We propose a type-theoretic framework for describing and proving properties of quantum computations, in particular those presented as quantum circuits. Our proposal is based on an observation that, in the polymorphic type system of Coq,…
This text is dedicated to the development of the theory of $(\infty,\omega)$-categories. We present generalizations of standard results from category theory, such as the lax Grothendieck construction, the Yoneda lemma, lax (co)limits and…
The quantum-mechanical description of assemblies of particles whose motion is confined to two (or one) spatial dimensions offers many possibilities that are distinct from bosons and fermions. We call such particles anyons. The simplest…
In this paper we give a new foundational, categorical formulation for operations and relations and objects parameterizing them. This generalizes and unifies the theory of operads and all their cousins including but not limited to PROPs,…
In this paper, we first introduce a technique that we call "Yoneda representation of flat functors", based on ideas from indexed category theory; then we provide applications of this technique to the theory of classifying toposes.…
Interest in combinatorial interpretations of mathematical entities stems from the convenience of the concrete models they provide. Finding a bijective proof of a seemingly obscure identity can reveal unsuspected significance to it. Finding…
Various models of $(\infty,1)$-categories, including quasi-categories, complete Segal spaces, Segal categories, and naturally marked simplicial sets can be considered as the objects of an $\infty$-cosmos. In a generic $\infty$-cosmos, whose…
We derive the category-theoretic backbone of quantum theory from a process ontology. More specifically, we treat quantum theory as a theory of systems, processes and their interactions. In this first part of a three-part overview, we first…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Quantum computational models can be approached via the lens of resources needed to perform computational tasks, where a computational advantage is achieved by consuming specific forms of quantum resources, or, conversely, resource-free…
In a previous paper we have presented a partition formula for the even-index Fibonacci numbers using the preprojective representations of the 3-Kronecker quiver and its universal cover, the 3-regular star. Now we deal in a similar way with…
Quantum computing exposes the brilliance of quantum mechanics through computer science and, as such, gives oneself a marvelous and exhilarating journey to go through. This article leads along that journey with a historical and current…
We use the terms $\infty$-categories and $\infty$-functors to mean the objects and morphisms in an $\infty$-cosmos: a simplicially enriched category satisfying a few axioms, reminiscent of an enriched category of fibrant objects.…