Related papers: Noncomputability Arising In Dynamical Triangulatio…
Topological classification of the 4-manifolds bridges computation theory and physics. A proof of the undecidability of the homeomorphy problem for 4-manifolds is outlined here in a clarifying way. It is shown that an arbitrary Turing…
This is the first in a series of papers where we will derive invariants of three-manifolds and framed knots in them from the geometry of a manifold pseudotriangulation put in some way in a four-dimensional Euclidean space. Thus, the…
The central topic of this thesis is two dimensional Quantum Gravity and its properties. The term Quantum Gravity itself is ambiguous as there are many proposals for its correct formulation and none of them have been verified experimentally.…
We provide detailed evidence for the claim that nonperturbative quantum gravity, defined through state sums of causal triangulated geometries, possesses a large-scale limit in which the dimension of spacetime is four and the dynamics of the…
We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing…
Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…
Studies of strongly nonlinear dynamical systems such as turbulent flows call for superior computational prowess. With the advent of quantum computing, a plethora of quantum algorithms have demonstrated, both theoretically and…
The hypercomputers compute functions or numbers, or more generally solve problems or carry out tasks, that cannot be computed or solved by a Turing machine. Several numerical simulations of a possible hypercomputational algorithm based on…
In the weak-coupling limit, kappa_0 going to infinity, the partition function of simplicial quantum gravity is dominated by an ensemble of triangulations with the ratio N_0/N_D close to the upper kinematic limit. For a combinatorial…
We review here the recent success in quantum annealing, i.e., optimization of the cost or energy functions of complex systems utilizing quantum fluctuations. The concept is introduced in successive steps through the studies of mapping of…
Computational complexity theory contains a corpus of theorems and conjectures regarding the time a Turing machine will need to solve certain types of problems as a function of the input size. Nature {\em need not} be a Turing machine and,…
We argue that theories of quantum gravity constructed with the help of (Causal) Dynamical Triangulations have given us the most informative, quantitative models to date of quantum spacetime. Most importantly, these are derived dynamically…
The triangulation complexity of a compact 3-manifold is the minimal number of tetrahedra in any triangulation of the 3-manifold. We compute the triangulation complexity of all elliptic 3-manifolds and all sol 3-manifolds, to within a…
Invariant manifolds are important constructs for the quantitative and qualitative understanding of nonlinear phenomena in dynamical systems. In nonlinear damped mechanical systems, for instance, spectral submanifolds have emerged as useful…
Based on a family of indefinite unitary representations of the diffeomorphism group of an oriented smooth $4$-manifold, a manifestly covariant $4$ dimensional and non-perturbative algebraic quantum field theory formulation of gravity is…
We present a possibility of coupling a point-like, non-singular, mass distribution to four-dimensional quantum gravity in the nonperturbative setting of causal dynamical triangulations (CDT). In order to provide a point of comparison for…
We present an efficient algorithm for twirling a multi-qudit quantum state. The algorithm can be used for approximating the twirling operation in an ensemble of physical systems in which the systems cannot be individually accessed. It can…
An outstanding problem in quantum computing is the calculation of entanglement, for which no closed-form algorithm exists. Here we solve that problem, and demonstrate the utility of a quantum neural computer, by showing, in simulation, that…
We develop a new and efficient method to systematically analyse four dimensional effective supergravities which descend from flux compactifications. The issue of finding vacua of such systems, both supersymmetric and non-supersymmetric, is…
Derandomization is the process of taking a randomized algorithm and turning it into a deterministic algorithm, which has attracted great attention in classical computing. In quantum computing, it is challenging and intriguing to derandomize…