Related papers: Analytic one-dimensional maps and two-dimensional …
We propose an implementation of a two-dimensional $\mathbb{Z}_2$ lattice gauge theory model on a shallow quantum circuit, involving a number of single and two-qubits gates comparable to what can be achieved with present-day and near-future…
The problem of parallel thread mapping is studied for the case of discrete orthogonal $m$-simplices. The possibility of a $O(1)$ time recursive block-space map $\lambda: \mathbb{Z}^m \mapsto \mathbb{Z}^m$ is analyzed from the point of view…
In this article, we improve the partial regularity theory for minimizing $1/2$-harmonic maps in the case where the target manifold is the $(m-1)$-dimensional sphere. For $m\geq 3$, we show that minimizing $1/2$-harmonic maps are smooth in…
Probabilistic circuits (PCs) are a class of tractable probabilistic models that allow efficient, often linear-time, inference of queries such as marginals and most probable explanations (MPE). However, marginal MAP, which is central to many…
We introduce an intermediate quantum computing model built from translation-invariant Ising-interacting spins. Despite being non-universal, the model cannot be classically efficiently simulated unless the polynomial hierarchy collapses.…
In this paper we develop a new machinery to study the capacity of artificial neural networks (ANNs) to approximate high-dimensional functions without suffering from the curse of dimensionality. Specifically, we introduce a concept which we…
A general construction is given for a class of invertible maps between the classical $U(sl(2))$ and the Jordanian $U_{h}(sl(2))$ algebras. Different maps are directly useful in different contexts. Similarity trasformations connecting them,…
In this paper we establish the equivalence of solutions between Schr\"odinger map into $\mathbb{S}^2$ or $ \mathbb{H}^2$ and their associated gauge invariant Schr\"odinger equations. We also establish the existence of global weak solutions…
We show that there is a strong minimal pair in the computably enumerable Turing degrees.
We consider discrete minimal surface algebras (DMSA) as generalized noncommutative analogues of minimal surfaces in higher dimensional spheres. These algebras appear naturally in membrane theory, where sequences of their representations are…
We study normal crossings compactifications of the moduli space of maps $\mathcal{M}_{g, n}(\mathbb{P}^r, d)$, for $g = 0$ and $g = 1$. In each case we explicitly determine the dual boundary complex, and prove that it admits a natural…
A coarse description of a subset A of omega is a subset D of omega such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse…
Simulating quantum circuits using classical computers lets us analyse the inner workings of quantum algorithms. The most complete type of simulation, strong simulation, is believed to be generally inefficient. Nevertheless, several…
Two algorithms are introduced for the computation of discrete integral transforms with a multiscale approach operating in discrete three-dimensional (3D) volumes while considering its real-time implementation. The first algorithm, referred…
We construct a structure preserving non-conforming finite element approximation scheme for the bi-harmonic wave maps into spheres equation. It satisfies a discrete energy law and preserves the non-convex sphere constraint of the continuous…
All global solutions of arbitrary topology of the most general 1+1 dimensional dilaton gravity models are obtained. We show that for a generic model there are globally smooth solutions on any non-compact 2-surface. The solution space is…
Quantum simulators were originally proposed for simulating one partial differential equation (PDE) in particular - Schrodinger's equation. Can quantum simulators also efficiently simulate other PDEs? While most computational methods for…
We develop an analytic theory of existence and regularity of surfaces (given by graphs) arising from the geometric minimization problem $$\min_{\mathcal{M}}\frac{1}{2}\int_{\mathcal{M}}|\nabla_{\mathcal{M}}H|^2\,dA$$ where $\mathcal{M}$…
Algorithmic reasoning requires capabilities which are most naturally understood through recurrent models of computation, like the Turing machine. However, Transformer models, while lacking recurrence, are able to perform such reasoning…
The 1+1D Ising model is an ideal benchmark for quantum algorithms, as it is very well understood theoretically. This is true even when expanding the model to include complex coupling constants. In this work, we implement quantum algorithms…