Gravitation from optimized computation: Einstein and beyond
Bibliographic record
Abstract
Abstract A new principle in quantum gravity, dubbed spacetime complexity, states that gravitational physics emerges from spacetime seeking to optimize the computational cost of its quantum dynamics. Thus far, this principle has been realized at the linearized level, in holographic theories with Einstein gravity duals, assuming the so-called ‘Complexity-Volume’ (CV) proposal. We expand on this proof in two significant directions. First, we derive higher-derivative gravitational equations by including appropriate corrections to the CV dictionary. Second, we show semi-classical equations arise by considering the leading bulk quantum corrections to CV. Our proof is valid for two-dimensional dilaton gravities, where the problem of semi-classical backreaction can be solved exactly. However, we argue the principle should hold more generally, leading us to a concrete proposal for bulk complexity of perturbative excited states in arbitrary dimensions. Our results demonstrate the robustness of spacetime complexity as a guiding principle to understand gravity in terms of quantum computation.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.005 |
| Scholarly communication | 0.002 | 0.006 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.004 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".