Related papers: Computational Complexity in Analogue Gravity
Modifications to Newtonian dynamics at low accelerations have long been proposed as an alternative to dark matter to explain galaxy rotation curves. More recently, similar corrections have been invoked to interpret anomalies in…
This article begins by putting forth a model that shows how the storage and retrieval of information on a wave function that involves quantum entanglement behaves similarly to the concepts of length contraction and time dilation,…
Clausius inequality has deep implications for reversibility and the arrow of time. Quantum theory is able to extend this result for closed systems by inspecting the trajectory of the density matrix on its manifold. Here we show that this…
This paper challenges some of the common assumptions underlying the mathematics used to describe the physical world. We start by reviewing many of the assumptions underlying the concepts of real, physical, rigid bodies and the translational…
Quantum complexity quantifies the difficulty of preparing a state or implementing a unitary transformation with limited resources. Applications range from quantum computation to condensed matter physics and quantum gravity. We seek to…
Analogue gravity offers an approach for testing the universality and robustness of quantum field theories in curved spacetimes and validating them using down-to-earth, laboratory-based experiments. Fluid interfaces are a promising framework…
In this article we use the idea of algorithmic complexity (AC) to study various cosmological scenarios, and as a means of quantizing the gravitational interaction. We look at 5D and 7D cosmological models where the Universe begins as a…
We propose a new approach for multiverse analysis based on computational complexity, which leads to a new family of "computational" measure factors. By defining a cosmology as a space-time containing a vacuum with specified properties (for…
This thesis introduces a set of methods for testing models of modified gravity using galaxy clusters. In particular, a technique for constraining models with a chameleon screening is introduced. In addition, the outlined technique is…
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 describe gauge theories which allow to retrieve a large class of gravitational theories, including, MacDowell-Mansouri gravity and its topological extension to Loop Quantum Gravity via the Pontrjagin characteristic class involving the…
The quantum geometric tensor (QGT) provides nontrivial bounds among physical quantities, as exemplified by the metric-curvature inequality. In this paper, we investigate various bounds for different observables through certain…
As a canonical and generally covariant gauge theory, loop quantum gravity requires special techniques to derive effective actions or equations. If the proper constructions are taken into account, the theory, in spite of considerable…
The purpose of this paper is to perform a quantitative check of gauge theory - gravity duality in a nonconformal, nonsupersymmetric context. In order to do so we define k5, an object extracted from the Wilson Loop, that plays the role of…
Standard cosmological models rely on an approximate treatment of gravity, utilizing solutions of the linearized Einstein equations as well as physical approximations. In an era of precision cosmology, we should ask: are these approximate…
In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…
The search for new computational machines beyond the traditional von Neumann architecture has given rise to a modern area of nonlinear science -- development of unconventional computing -- requiring the efforts of mathematicians, physicists…
A new principle in quantum gravity, dubbed spacetime complexity, states that gravitational physics emerges from spacetime seeking to optimize the computational cost of its quantum dynamics. Thus far, this principle has been realized at the…
In physics, two systems that radically differ at short scales can exhibit strikingly similar macroscopic behaviour: they are part of the same long-distance universality class. Here we apply this viewpoint to geometry and initiate a program…
Bayesian inference requires approximation methods to become computable, but for most of them it is impossible to quantify how close the approximation is to the true posterior. In this work, we present a theorem upper-bounding the KL…