.png){kind=icon}
.png){kind=icon}
Return
Computing the Graph-Changing Dynamics of Loop Quantum Gravity
.png){kind=icon}
OA
AI
DOI：10.3390/universe11120387.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In loop quantum gravity (LQG), states of the gravitational field are represented by labeled graphs called spin networks. Their dynamics can be described by a Hamiltonian constraint, which acts on the spin network states, modifying both spins and graphs. Fixed-graph approximations of the dynamics have been extensively studied, but its full graph-changing action so far remains elusive. The latter, alongside the solutions of its constraint, are arguably the missing features in canonical LQG to access phenomenology in all its richness. Here, we discuss a recently developed numerical tool that, for the first time, implements graph-changing dynamics via the Hamiltonian constraint. We explain how it is used to find new solutions to that constraint and to show that some quantum geometric observables behave differently than in the graph-preserving truncation. We also point out that these new numerical methods can find applications in other domains.
Keywords:
loop quantum gravity
canonical general relativity
hamiltonian constraint
challenges in gravitational physics
04.60.-m
04.60.Pp
98.80.Qc
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
U
IF:
2.6
Papers:
212
Citations:
0