Related papers: The Non-Euclidean Euclidean Algorithm
Quantum algorithms are built enabling to find Poincar\'e recurrence times and periodic orbits of classical dynamical systems. It is shown that exponential gain compared to classical algorithms can be reached for a restricted class of…
A uniformly discrete Euclidean graph is a graph embedded in a Euclidean space so that there is a minimum distance between distinct vertices. If such a graph embedded in an $n$-dimensional space is preserved under $n$ linearly independent…
We study the bit complexity of two methods, related to the Euclidean algorithm, for computing cubic and quartic analogs of the Jacobi symbol. The main bottleneck in such procedures is computation of a quotient for long division. We give…
Relativistic invariance in Euclidean formulations of quantum mechanics is discussed. Relativistic treatments of quantum theory are needed to study hadronic systems at sub-hadronic distance scales. Euclidean formulations of relativistic…
We propose a new approach to quantize the marginals of the discrete Euler diffusion process. The method is built recursively and involves the conditional distribution of the marginals of the discrete Euler process. Analytically, the method…
We obtain non asymptotic bounds for the Monte Carlo algorithm associated to the Euler discretization of some diffusion processes. The key tool is the Gaussian concentration satisfied by the density of the discretization scheme. This…
We study a three dimensional non-commutative space emerging in the context of three dimensional Euclidean quantum gravity. Our starting point is the assumption that the isometry group is deformed to the Drinfeld double D(SU(2)). We…
Estimating expectation values on near-term quantum computers often requires a prohibitively large number of measurements. One widely-used strategy to mitigate this problem has been to partition an operator's Pauli terms into sets of…
This study provides new results about the probabilistic behaviour of a class of Euclidean algorithms: the asymptotic distribution of a whole class of cost-parameters associated to these algorithms is normal. For the cost corresponding to…
In this paper, we study differentially private (DP) algorithms for computing the geometric median (GM) of a dataset: Given $n$ points, $x_1,\dots,x_n$ in $\mathbb{R}^d$, the goal is to find a point $\theta$ that minimizes the sum of the…
Two averaging algorithms are considered which are intended for choosing an optimal plane and an optimal circle approximating a group of points in three-dimensional Euclidean space.
The kinematics of a robot manipulator are described in terms of the mapping connecting its joint space and the 6-dimensional Euclidean group of motions $SE(3)$. The associated Jacobian matrices map into its Lie algebra $\mathfrak{se}(3)$,…
A simple and efficient algorithm to numerically compute the genus of surfaces of three-dimensional objects using the Euler characteristic formula is presented. The algorithm applies to objects obtained by thresholding a scalar field in a…
We propose a method for demonstrating equivalences beyond the saddlepoint approximation between quantities in quantum gravity that are defined by the Euclidean path integral, without assumptions about holographic duality. The method…
With the advent of ultra-high power lasers the nonlinear nature of the vacuum of quantum electrodynamics (QED) can be probed. Due to the highly nonlinear structure of the underlying equations new numerical algorithms are required. A…
The purpose of the present article is the study of duals of functional codes on algebraic surfaces. We give a direct geometrical description of them, using differentials. Even if this geometrical description is less trivial, it can be…
We provide an explicit recursive divide and conquer approach for simulating quantum dynamics and derive a discrete first quantized non-relativistic QED Hamiltonian based on the many-particle Pauli Fierz Hamiltonian. We apply this recursive…
Linear projection schemes like Proper Orthogonal Decomposition can efficiently reduce the dimensions of dynamical systems but are naturally limited, e.g., for convection-dominated problems. Nonlinear approaches have shown to outperform…
The aim of this paper is to analyse algorithms for constructing presentations of graph braid groups from the point of view of anyonic quantum statistics on graphs. In the first part of this paper, we provide a comprehensive review of an…
We briefly describe our application of a version of noncommutative differential geometry to the 3-dim quantum space covariant under the quantum group of rotations $SO_q(3)$ and sketch how this might be used to determine the correct physical…