Related papers: Analytic one-dimensional maps and two-dimensional …
Simulating quantum dynamics on classical computers is challenging for large systems due to the significant memory requirements. Simulation on quantum computers is a promising alternative, but fully optimizing quantum circuits to minimize…
We develop a correspondence between the structure of Turing machines and the structure of singularities of real analytic functions, based on connecting the Ehrhard-Regnier derivative from linear logic with the role of geometry in Watanabe's…
We begin to study classical dimension theory from the computable analysis (TTE) point of view. For computable metric spaces, several effectivisations of zero-dimensionality are shown to be equivalent. The part of this characterisation that…
A $n\times n$ matrix $A$ has normal defect one if it is not normal, however can be embedded as a north-western block into a normal matrix of size $(n+1)\times (n+1)$. The latter is called a minimal normal completion of $A$. A construction…
Potential algebras can be used effectively in the analysis of the quantum systems. In the article, we focus on the systems described by a separable, 2x2 matrix Hamiltonian of the first order in derivatives. We find integrals of motion of…
We derive and analyze the perturbation series for the classical effective action in quantum statistical mechanics, treated as a toy model for the dimensionally reduced effective action in quantum field theory at finite temperature. The…
Optimization problems are a staple of today's scientific and technical landscape. However, at present, solvers of such problems are almost exclusively run on digital hardware. Using Turing machines as a mathematical model for any type of…
We discuss general one and two-loop banana diagrams and one-loop diagrams with external lines with arbitrary masses on the anti de Sitter spacetime by using methods of AdS quantum field theory in the dimensional regularization approach. The…
Invertible compositions of one-dimensional maps are studied which are assumed to include maps with non-positive Schwarzian derivative and others whose sum of distortions is bounded. If the assumptions of the Koebe principle hold, we show…
Dynamical Ising machines are continuous dynamical systems that evolve from a generic initial state to a state strongly related to the ground state of the classical Ising model. We show that such a machine driven by the V${}_2$ dynamical…
Recent models for discrete euclidean quantum gravity incorporate a sum over simplicial triangulations. We describe an algorithm for simulating such models in general dimensions. As illustration we show results from simulations in four…
Deep neural networks have seen tremendous success over the last years. Since the training is performed on digital hardware, in this paper, we analyze what actually can be computed on current hardware platforms modeled as Turing machines,…
The iteration of rational maps is well-understood in dimension 1 but less so in higher dimensions. We study some maps on spaces of matrices which present a weak complexity with respect to the ring structure. First we give some properties of…
This paper investigates scalable frame in ${\mathbb R}^n$. We define the reduced diagram matrix of a frame and use it to classify scalability of the frame under some conditions. We give a new approach to the scaling problem by breaking the…
This paper discusses how to implement certain classes of quantum computer algorithms using classical discrete switching networks that are amenable to implementation in main stream CMOS transistor IC technology. The methods differ from other…
We introduce and investigate numerically a minimal class of dynamical triangulations of two-dimensional gravity on the sphere in which only vertices of order five, six or seven are permitted. We show firstly that this restriction of the…
We study the weak call-by-value $\lambda$-calculus as a model for computational complexity theory and establish the natural measures for time and space -- the number of beta-reductions and the size of the largest term in a computation -- as…
We introduce an effective algorithmic method for the computation of a lower bound for uniform expansion in one-dimensional dynamics. The approach employs interval arithmetic and thus provides a rigorous numerical result (computer-assisted…
In this note, we show that the solution to the Dirichlet problem for the minimal surface system in any codimension is unique in the space of distance-decreasing maps. This follows as a corollary of the following stability theorem: if a…
A map from a manifold to a Euclidean space is said to be k-regular if the image of any distinct k points are linearly independent. In this paper, we give some lower bounds of the dimension of the ambient Euclidean space for complex…