Related papers: A generalization of the Newton-Puiseux algorithm f…
We propose a framework for topological quantum computation using newly discovered non-semisimple analogs of topological quantum field theories in 2+1 dimensions. These enhanced theories offer more powerful models for quantum computation.…
Using the machinery of smooth scaling and coarse-graining of observables, developed recently in the context of so-called fluctuation operators (originally developed by Verbeure et al), we extend this approach to a rigorous renormalisation…
The Hamiltonian cycle problem (HCP), which is an NP-complete problem, consists of having a graph G with n nodes and m edges and finding the path that connects each node exactly once. In this paper we compare some algorithms to solve a…
Stochastic nonequilibrium exclusion models are treated using a real space scaling approach. The method exploits the mapping between nonequilibrium and quantum systems, and it is developed to accommodate conservation laws and duality…
Due to the Heisenberg uncertainty principle, various classical systems differing only on the scale smaller than Planck's cell correspond to the same quantum system. This fact is used to find a unique semiclassical representation without the…
A computationally challenging classical elimination theory problem is to compute polynomials which vanish on the set of tensors of a given rank. By moving away from computing polynomials via elimination theory to computing pseudowitness…
We describe a new algorithm for computing the ideal class group, the regulator and a system of fundamental units in number fields under the generalized Riemann hypothesis. We use sieving techniques adapted from the number field sieve…
We describe an algorithm that associates to each positive real number $r$ and each finite collection $C_r$ of planar pixels of size $r$ a planar piecewise linear set $S_r$ with the following additional property: if $C_r$ is the collection…
We prove a large finite field version of the Boston--Markin conjecture on counting Galois extensions of the rational function field with a given Galois group and the smallest possible number of ramified primes. Our proof involves a study of…
In this paper we give a unified approach in categorical setting to the problem of finding the Galois closure of a finite cover, which includes as special cases the familiar finite separable field extensions, finite unramified covers of a…
We develop coarse-graining tensor renormalization group algorithms to compute physical properties of two-dimensional lattice models on finite periodic lattices. Two different coarse-graining strategies, one based on the tensor…
In this paper, we study tropical-theoretic aspects of the ``rectification algorithm'' on skew Young tableaux. It is shown that the algorithm is interpreted as a time evolution of some tropical integrable system. By using this fact, we…
We study rational normal curves via a connection to the chip firing game. A key technique, introduced in this article, is to interpret the defining ideal of the rational normal curve as an ideal associated to a generalisation of a cycle…
In this paper, we establish a method for model order reduction of a certain class of physical network systems. The proposed method is based on clustering of the vertices of the underlying graph, and yields a reduced order model within the…
Consider an ideal $I \subset R = \bC[x_1,...,x_n]$ defining a complex affine variety $X \subset \bC^n$. We describe the components associated to $I$ by means of {\em numerical primary decomposition} (NPD). The method is based on the…
We prove that $\bar {\mathbb Q}_\ell$-local systems of bounded rank and ramification on a smooth variety $X$ defined over an algebraically closed field $k$ of characteristic $p\neq \ell$ are tamified outside of codimension $2$ by a finite…
The $k$-core decomposition is a widely studied summary statistic that describes a graph's global connectivity structure. In this paper, we move beyond using $k$-core decomposition as a tool to summarize a graph and propose using $k$-core…
A major limitation of exact inference algorithms for probabilistic graphical models is their extensive memory usage, which often puts real-world problems out of their reach. In this paper we show how we can extend inference algorithms,…
A polar hypersurface P of a complex analytic hypersurface germ, f=0, can be investigated by analyzing the invariance of certain Newton polyhedra associated to the image of P, with respect to suitable coordinates, by certain morphisms…
We present elementary mappings between classical lattice models and quantum circuits. These mappings provide a general framework to obtain efficiently simulable quantum gate sets from exactly solvable classical models. For example, we…