Related papers: Testing the Master Constraint Programme for Loop Q…
Several quantum algorithms for linear algebra problems, and in particular quantum machine learning problems, have been "dequantized" in the past few years. These dequantization results typically hold when classical algorithms can access the…
In a series of seminal papers, Laddha and Varadarajan have developed in depth the quantisation of Parametrised Field Theory (PFT) in the kind of discontinuous representations that are employed in Loop Quantum Gravity (LQG). In one spatial…
In the canonical approach of loop quantum gravity, arguably the most important outstanding problem is finding and interpreting solutions to the Hamiltonian constraint. In this work, we demonstrate that methods of machine learning are in…
In this paper, we are going to discuss the gauge reduction with respect to the simplicity constraint in both classical and quantum theory of all dimensional loop quantum gravity. With the gauge reduction with respect to edge-simplicity…
This study investigates quantum gravity effects within the framework of an effective loop quantum gravity (LQG) black hole model parameterized by $\zeta$, utilizing precision measurements from solar system experiments and astrophysical…
This article presents an "in-a-nutshell" yet self-contained introductory review on loop quantum gravity (LQG) -- a background-independent, nonperturbative approach to a consistent quantum theory of gravity. Instead of rigorous and…
We introduce a new regularization scheme for Quantum Cosmology in Loop Quantum Gravity (LQG) using the tools of Quantum Reduced Loop Gravity (QRLG). It is obtained considering density matrices for superposition of graphs based on…
We shall here perform the canonical analysis of field equations of ABI model in order to determine constraint equations. We shall show that one can use algebraic constraints in the covariant framework to fix $k^i$ as a function of the frame…
Effective models of black holes interior have led to several proposals for regular black holes. In the so-called polymer models, based on effective deformations of the phase space of spherically symmetric general relativity in vacuum, one…
In the past years, augmented Lagrangian methods have been successfully applied to several classes of non-convex optimization problems, inspiring new developments in both theory and practice. In this paper we bring most of these recent…
We investigate finite-dimensional constrained structured optimization problems, featuring composite objective functions and set-membership constraints. Offering an expressive yet simple language, this problem class provides a modeling…
Recently, a generally covariant reformulation of 2 dimensional flat spacetime free scalar field theory known as Parameterised Field Theory was quantized using Loop Quantum Gravity (LQG) type `polymer' representations. Physical states were…
The use of non-regular representations of the Heisenberg-Weyl commutation relations has proved to be useful for studying conceptual and technical issues in quantum gravity. Of particular relevance is the study of Loop Quantum Cosmology…
Quantum computing is emerging as a new computing resource that could be superior to conventional computing for certain classes of optimization problems. However, in principle, most existing approaches to quantum optimization are intended to…
We investigate refined algebraic quantisation within a family of classically equivalent constrained Hamiltonian systems that are related to each other by rescaling a momentum-type constraint. The quantum constraint is implemented by a…
An open issue in loop quantum gravity (LQG) is the introduction of a non-vanishing cosmological constant $\Lambda$. In 3d, Chern-Simons theory provides some guiding lines: $\Lambda$ appears in the quantum deformation of the gauge group. The…
Loop quantum gravity corrections, in the presence of inhomogeneities, can lead to a deformed constraint algebra. Such a deformation implies that the effective theory is no longer generally covariant. As a consequence, the geometrical…
Trying to solve hard optimisation problems with quantum techniques requires transformations of domain objectives and constraints into formats compatible with a chosen quantum algorithm. This often introduces inefficiencies and overheads…
This paper presents an algorithmic study of a class of covering mixed-integer linear programming problems which encompasses classic cover problems, including multidimensional knapsack, facility location and supplier selection problems. We…
Central issues of the Dirac constraint formalism are discussed in relation to the algorithmic methods of commutative algebra based on the Groebner basis techniques. For a wide class of finite dimensional polynomial degenerate Lagrangian…