REVIEW 1 cited by
Markov Chain Monte Carlo methods for graph refinement in Spinfoam Cosmology
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Markov Chain Monte Carlo methods for graph refinement in Spinfoam Cosmology
read the original abstract
We study the behaviour of the Lorentzian Engle-Pereira-Rovelli-Livine spinfoam amplitude with homogeneous boundary data, under a graph refinement going from five to twenty boundary tetrahedra. This can be interpreted as a wave function of the universe, for which we compute boundary geometrical operators, correlation functions and entanglement entropy. The numerical calculation is made possible by adapting the Metropolis-Hastings algorithm, along with recently developed computational methods appropriate for the deep quantum regime. We confirm that the transition amplitudes are stable against such refinement. We find that the average boundary geometry does not change, but the new degrees of freedom correct the quantum fluctuations of the boundary and the correlations between spatial patches. The expectation values are compatible with their geometrical interpretation and the correlations between neighbouring patches decay when computed across different spinfoam vertices.
Forward citations
Cited by 1 Pith paper
-
Toller matrices and the Feynman $i\varepsilon$ in spinfoams
Toller matrices T^(±) in causal spinfoam amplitudes satisfy T^(+) + T^(-) = D and admit equivalent definitions via analyticity, iε prescription, and boost-eigenvalue integrals that reproduce the Euclidean-to-Lorentzia...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.