Searcharxiv⌕ Search

arXiv subjects

Zachary Weller-Davies

Publications and source records attributed to Zachary Weller-Davies.

20 records · Page 2Linked to original sources

The constraints of post-quantum classical gravity

We study a class of theories in which space-time is treated classically, while interacting with quantum fields. These circumvent various no-go theorems and the pathologies of semi-classical gravity, by being linear in the density matrix and phase-space density. The theory can either be considered fundamental or as an effective theory where the classical limit is taken of space-time. The theories have the dynamics of general relativity as their classical limit and provide a way to study the back-action of quantum fields on the space-time metric. The theory is invariant under spatial diffeomorphisms, and here, we provide a methodology to derive the constraint equations of such a theory by imposing invariance of the dynamics under time-reparametrization invariance. This leads to generalisations of the Hamiltonian and momentum constraints. We compute the constraint algebra for a wide class of realisations of the theory (the "discrete class") in the case of a quantum scalar field interacting with gravity. We find that the algebra doesn't close without additional constraints, although these do not necessarily reduce the number of local degrees of freedom.

hep-th↗

Lorentzian threads as 'gatelines' and holographic complexity

The continuous min flow-max cut principle is used to reformulate the 'complexity=volume' conjecture using Lorentzian flows -- divergenceless norm-bounded timelike vector fields whose minimum flux through a boundary subregion is equal to the volume of the homologous maximal bulk Cauchy slice. The nesting property is used to show the rate of complexity is bounded below by "conditional complexity", describing a multi-step optimization with intermediate and final target states. Conceptually, discretized Lorentzian flows are interpreted in terms of threads or gatelines such that complexity is equal to the minimum number of gatelines used to prepare a CFT state by an optimal tensor network (TN) discretizing the state. We propose a refined measure of complexity, capturing the role of suboptimal TNs, as an ensemble average. The bulk symplectic potential provides a 'canonical' thread configuration characterizing perturbations around arbitrary CFT states. Its consistency requires the bulk to obey linearized Einstein's equations, which are shown to be equivalent to the holographic first law of complexity, thereby advocating a notion of 'spacetime complexity'.

hep-th↗