Related papers: Testing the Master Constraint Programme for Loop Q…

An outstanding open issue in our quest for physics beyond Einstein is the unification of general relativity (GR) and quantum physics. Loop quantum gravity (LQG) is a leading approach toward this goal. At its heart is the central lesson of…

The intention of this thesis is to provide general tools and concepts that allow to perform a mathematically substantiated symmetry reduction in (quantum) gauge field theories. Here, the main focus is on the framework of loop quantum…

The present article is primarily a review of the projection-operator approach to quantize systems with constraints. We study the quantization of systems with general first- and second-class constraints from the point of view of…

We provide a detailed comparison of the different approaches available for the quantization of a totally constrained system with a constraint algebra generating the non-compact $SL(2,\mathbb{R})$ group. In particular, we consider three…

We review aspects of loop quantum gravity in a pedagogical manner, with the aim of enabling a precise but critical assessment of its achievements so far. We emphasise that the off-shell (`strong') closure of the constraint algebra is a…

A new representation of Quantum Gravity is developed. This formulation is based on an extension of the group of loops. The enlarged group, that we call the Extended Loop Group, behaves locally as an infinite dimensional Lie group. Quantum…

In these lectures we report recent work on the exact quantization of dimensionally reduced gravity, i.e. 2d non-linear (G/H)-coset space sigma-models coupled to gravity and a dilaton. Using methods developed in the context of flat space…

The Sequential Linear Quadratic (SLQ) algorithm is a continuous-time variant of the well-known Differential Dynamic Programming (DDP) technique with a Gauss-Newton Hessian approximation. This family of methods has gained popularity in the…

In this paper, our goal is to study fundamental foundations of linear quadratic Gaussian (LQG) control problems for stochastic linear time-invariant systems via Lagrangian duality of semidefinite programming (SDP) problems. In particular,…

A rigorous implementation of the Wheeler-Dewitt equations was derived in the context of Loop Quantum Gravity (LQG) and was coined Quantum Spin Dynamics (QSD). The Hamiltonian constraint of QSD was criticised as being too local and to…

We initiate the hunt for a definition of Hamiltonian constraint in Euclidean Loop Quantum Gravity (LQG) which faithfully represents quantum Dirac algebra. Borrowing key ideas from previous works on Hamiltonian constraint in LQG and several…

This paper studies the limitations of the generic approaches to solving cryptographic problems in classical and quantum settings in various models. - In the classical generic group model (GGM), we find simple alternative proofs for the…

Decoded Quantum Interferometry (DQI) is a recently introduced quantum algorithm that reduces discrete optimization to decoding with potential advantages over the best-known polynomial-time classical algorithms for certain Max-LINSAT…

The consistent embedding of Loop Quantum Gravity (LQG) effects within the Standard Model requires a rigorous understanding of how Planck-scale deformations manifest at low energies. While phenomenological approaches often introduce…

The quantum-reduced loop-gravity technique has been introduced for dealing with cosmological models. We show that it can be applied rather generically: anytime the spatial metric can be gauge-fixed to a diagonal form. The technique selects…

Classically the constraint algebra of general relativity, which generates gauge transformations, is equivalent to spacetime covariance. In LQG, inverse triad corrections lead to an effective Hamiltonian constraint which can lead to a…

We construct the regularised Wheeler-De Witt operator demanding that the algebra of constraints of quantum gravity is anomaly free. We find that for a subset of all wavefunctions being integrals of scalar densities this condition can be…

We define a modification of LQG in which graphs are required to consist in piecewise linear edges, which we call piecewise linear LQG (plLQG). At the diffeomorphism invariant level, we prove that plLQG is equivalent to standard LQG, as long…

This paper addresses the end-to-end sample complexity bound for learning the H2 optimal controller (the Linear Quadratic Gaussian (LQG) problem) with unknown dynamics, for potentially unstable Linear Time Invariant (LTI) systems. The robust…

The problem of simulating complex quantum processes on classical computers gave rise to the field of quantum simulations. Quantum simulators solve problems, such as Boson sampling, where classical counterparts fail. In another field of…