Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSymmetric Monoidal Structure with Local Character is a Property
126
0
0.0
(
0
)
Authors
Stefano Gogioso
Ask ChatGPT about the research
No Arabic abstract
In previous work we proved that, for categories of free finite-dimensional modules over a commutative semiring, linear compact-closed symmetric monoidal structure is a property, rather than a structure. That is, if there is such a structure, then it is uniquely defined (up to monoidal equivalence). Here we provide a novel unifying category-theoretic notion of symmetric monoidal structure with local character, which we prove to be a property for a much broader spectrum of categorical examples, including the infinite-dimensional case of relations over a quantale and the non-free case of finitely generated modules over a principal ideal domain.
rate research
Read More
We show how to construct a Gamma-bicategory from a symmetric monoidal bicategory, and use that to show that the classifying space is an infinite loop space upon group completion. We also show a way to relate this construction to the classic Gamma-category construction for a bipermutative category. As an example, we use this machinery to construct a delooping of the K-theory of a bimonoidal category as defined by Baas-Dundas-Rognes.
We define a notion of symmetric monoidal closed (SMC) theory, consisting of a SMC signature augmented with equations, and describe the classifying categories of such theories in terms of proof nets.
We study abelian envelopes for pseudo-tensor categories with the property that every object in the envelope is a quotient of an object in the pseudo-tensor category. We establish an intrinsic criterion on pseudo-tensor categories for the existence of an abelian envelope satisfying this quotient property. This allows us to interpret the extension of scalars and Deligne tensor product of tensor categories as abelian envelopes, and to enlarge the class of tensor categories for which all extensions of scalars and tensor products are known to remain tensor categories. For an affine group scheme G, we show that pseudo-tensor subcategories of RepG have abelian envelopes with the quotient property, and we study many other such examples. This leads us to conjecture that all abelian envelopes satisfy the quotient property.
We start from any small strict monoidal braided Ab-category and extend it to a monoidal nonstrict braided Ab-category which contains braided bialgebras. The objects of the original category turn out to be modules for these bialgebras
Suppose a Boolean function $f$ is symmetric under a group action $G$ acting on the $n$ bits of the input. For which $G$ does this mean $f$ does not have an exponential quantum speedup? Is there a characterization of how rich $G$ must be before the function $f$ cannot have enough structure for quantum algorithms to exploit? In this work, we make several steps towards understanding the group actions $G$ which are quantum intolerant in this way. We show that sufficiently transitive group actions do not allow a quantum speedup, and that a well-shuffling property of group actions -- which happens to be preserved by several natural transformations -- implies a lack of super-polynomial speedups for functions symmetric under the group action. Our techniques are motivated by a recent paper by Chailloux (2018), which deals with the case where $G=S_n$. Our main application is for graph symmetries: we show that any Boolean function $f$ defined on the adjacency matrix of a graph (and symmetric under relabeling the vertices of the graph) has a power $6$ relationship between its randomized and quantum query complexities, even if $f$ is a partial function. In particular, this means no graph property testing problems can have super-polynomial quantum speedups, settling an open problem of Ambainis, Childs, and Liu (2011).
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
