Related papers: Analytic one-dimensional maps and two-dimensional …
Discrete translational symmetry plays a fundamental role in condensed matter physics and lattice gauge theories, enabling the analysis of systems that would otherwise be intractable. Despite this, many open problems remain. Quantum…
This paper shows that the programming model of Babbage's Analytical Engine, although unconventional, can be harnessed in order to simulate indirect addressing, a capability that was not included in the original instruction set. That is, in…
We propose reactive Turing machines (RTMs), extending classical Turing machines with a process-theoretical notion of interaction, and use it to define a notion of executable transition system. We show that every computable transition system…
The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…
We provide sufficient conditions on integrable analytic Hamiltonians that guarantee the existence, under arbitrary sufficiently small analytic perturbations, of invariant lower dimensional tori associated to an invariant resonant torus of…
The 1+1D O(3) non-linear {\sigma}-model is a model system for future quantum lattice simulations of other asymptotically-free theories, such as non-Abelian gauge theories. We find that utilizing dimensional reduction can make efficient use…
Quantum simulation promises to address many challenges in fields ranging from quantum chemistry to material science, and high-energy physics, and could be implemented in noisy intermediate-scale quantum devices. A challenge in building good…
We prove that any Turing machine running on inputs of arbitrary length can be simulated by a constant bit-size transformer, as long as the context window is sufficiently long. This improves previous works, which require scaling up either…
A caveat to many applications of the current Deep Learning approach is the need for large-scale data. One improvement suggested by Kolmogorov Complexity results is to apply the minimum description length principle with computationally…
We study reductions that limit the extreme adaptivity of Turing reductions. In particular, we study reductions that make a rapid, structured progression through the set to which they are reducing: Each query is strictly longer (shorter)…
What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? Dodd et al. (quant-ph/0106064) provided a partial solution to this problem in the form of an efficient algorithm to simulate any desired…
We experimentally demonstrate that it is impossible to simulate quantum bipartite correlations with a deterministic universal Turing machine. Our approach is based on the Normalized Information Distance (NID) that allows the comparison of…
We study how to construct explicit deformations of generic smooth maps from closed $n$--dimensional manifolds $M$ with $n \geq 2$ to the $2$--sphere $S^2$ and show that every smooth map $M \to S^2$ is homotopic to a $C^\infty$ stable map…
Quantum algorithms for computing classical nonlinear maps are widely known for toy problems but might not suit potential applications to realistic physics simulations. Here, we propose how to compute a general differentiable invertible…
The Minimal Model Program offers natural higher-dimensional analogues of stable $n$-pointed curves and maps: stable pairs consisting of a projective variety $X$ of dimension $\ge2$ and a divisor $B$, that should satisfy a few simple…
We present a generalization of standard Turing machines based on allowing unusual tapes. We present a set of reasonable constraints on tape geometry and classify all tapes conforming to these constraints. Surprisingly, this generalization…
We investigate metric conditions that allow to prove existence and uniqueness of a map solving the Monge problem between two marginals in a metric (measure) space, proving two main results. Firstly, we introduce a nonsmooth version of the…
In this paper we consider the computational complexity of uniformizing a domain with a given computable boundary. We give nontrivial upper and lower bounds in two settings: when the approximation of boundary is given either as a list of…
I derive a formulation of the 2-dimensional critical Ising model on non-uniform simplicial lattices. Surprisingly, the derivation leads to a set of geometric constraints that a lattice must satisfy in order for the model to have a…
Since the seminal work of Schoen-Uhlenbeck, many authors have studied properties of harmonic maps satisfying Dirichlet boundary conditions. In this article, we instead investigate regularity and symmetry of $\mathbb{S}^2-$valued minimizing…