Related papers: Complexity Classes as Mathematical Axioms II
The same set of physically motivated axioms can be used to construct both the classical ensemble Hamilton-Jacobi equation and Schrodingers equation. Crucial roles are played by the assumptions of universality and simplicity (Occam's Razor)…
We investigate the possibility to separate the bisimulation-invariant fragment of P from that of NP, resp. PSPACE. We build on Otto's Theorem stating that the bisimulation-invariant queries in P are exactly those that are definable in the…
The "quantum complexity" of a unitary operator measures the difficulty of its construction from a set of elementary quantum gates. While the notion of quantum complexity was first introduced as a quantum generalization of the classical…
We present infinite analogues of our splinter lemma from [Trees of tangles in abstract separation systems, arXiv:1909.09030]. From these we derive several tree-of-tangles-type theorems for infinite graphs and infinite abstract separation…
Topological quantum field theories can be used as a powerful tool to probe geometry and topology in low dimensions. Chern-Simons theories, which are examples of such field theories, provide a field theoretic framework for the study of knots…
We generalize the theory of base norm spaces to the complex case, and further to the noncommutative setting relevant to `quantum convexity'. In particular, we establish the duality between complex Archimedean order unit spaces and complex…
This work concludes a series of four papers on the foundational theory of orbifolds and stacks. We apply the abstract theory, developed in its predecessors, to orbifolds derived from manifolds. Specifically, we show how the very concrete…
This paper establishes the separation of complexity classes $\mathbf{P}$ and $\mathbf{NP}$ through a novel homological algebraic approach grounded in category theory. We construct the computational category $\mathbf{Comp}$, embedding…
We classify two-qubit commuting Hamiltonians in terms of their computational complexity. Suppose one has a two-qubit commuting Hamiltonian H which one can apply to any pair of qubits, starting in a computational basis state. We prove a…
Many real-world complex networks actually have a bipartite nature: their nodes may be separated into two classes, the links being between nodes of different classes only. Despite this, and despite the fact that many ad-hoc tools have been…
Geometric Complexity Theory as initiated by Mulmuley and Sohoni in two papers (SIAM J Comput 2001, 2008) aims to separate algebraic complexity classes via representation theoretic multiplicities in coordinate rings of specific group…
We define secondary theories and characteristic classes for simplicial smooth manifolds generalizing Karoubi's multiplicative K-theory and multiplicative cohomology groups for smooth manifolds. As a special case we get versions of the…
In contrast to classical strongly continuous semigroups, the study of bi-continuous semigroups comes with some freedom in the properties of the associated locally convex topology. This paper aims to give minimal assumptions in order to…
We address the "inverse problem" for discrete geometry, which consists in determining whether, given a discrete structure of a type that does not in general imply geometrical information or even a topology, one can associate with it a…
We investigate the following three consistency conditions for constructing string theories on orbifolds: i) the invariance of the energy-momentum tensors under twist operators, ii) the duality of amplitudes and iii) modular invariance of…
A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…
The concept of complexity appears in virtually all areas of knowledge. Its intuitive meaning shares similarities across fields, but disagreements between its details hinders a general definition, leading to a plethora of proposed…
We study the complexity of the model checking problem, for fixed model A, over certain fragments L of first-order logic. These are sometimes known as the expression complexities of L. We obtain various complexity classification theorems for…
We propose a new classification scheme for quantum entanglement based on topological links. This is done by identifying a non-rigid ring to a particle, attributing the act of cutting and removing a ring to the operation of tracing out the…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…