Booklet Cosmological States as Random-Tensor Codes: Recovery Bounds and Entropic Diagnostics for Multi-Boundary Baby Universes

In the paper's words

Cosmological states in holography can contain closed "baby" universes inaccessible to any single asymptotic boundary, raising the question of whether the information they carry is recoverable, and from where. The booklet cosmology construction extends the two-boundary cosmological-state proposal of Antonini, Sasieta and Swingle to three or more holographic CFTs glued along a common interface, and models the resulting cosmology-to-boundary map by a circular complex Gaussian random tensor, i.e., a tripartite Haar-like state in flat energy windows. We treat this Gaussian model as a quantum error-correcting code whose logical system is the central closed universe and whose three arms are recovery regions.

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

1. At representative dimensions $b=10^{6}$, $K=10^{3}$ we obtain excess purity $\approx 10^{-12}$, single-arm entropy $\approx 19.93$ bits, and recovery error $\le 10^{-3}$, with conservative Markov and union bounds giving a simultaneous three-pair success probability of at least $0.8125$ at a $4\times10^{-3}$ error threshold.

   from Abstract

2. Second, to place the construction in the lineage of quantum cosmology, from Wheeler-DeWitt-based programs [3], [4], [8] through loop and modified loop quantum cosmology [6], [7], [9], gravitational-entropy arguments [5], and quantum-gravity environment models [10], and to identify what is genuinely new: the random-tensor/quantum-error-correction (QEC) lens.

   from 1. Introduction

3. Our central quantitative results, all derived in Section 4 from the Gaussian/Haar model with per-arm dimension $b$: (i) the excess purity of a single arm over the maximally mixed value scales as $1/b^{2}$, evaluated to $\approx 1.0\times10^{-12}$ at $b=10^{6}$; (ii) the single-arm entropy is $\ln b$ nats up to a Page correction of order $1/(2b)$, giving $\approx 19.93$ bits at $b=10^{6}$; (iii) the two-arm recovery error for a code of dimension $K$ scales linearly as $K/b$, giving $10^{-3}$ at $K=10^{3}$, $b=10^{6}$.

   from 1. Introduction

4. (arXiv:2608.03944): quantum error correction and Quantum Darwinism cannot coexist above a critical logical fidelity $F_{L} \gt 0.874$, establishing a tradeoff between protected quantum information and emergent classical objectivity.

   from 2. Background and Related Work

5. Whether the $F_{L}$ threshold binds in the Gaussian model depends on details not fixed by [2] or [13]; we analyze the tension qualitatively in Section 6.

   from 2. Background and Related Work

6. The leading Page result for the average entropy of a small subsystem is $$\mathbb{E}[S_{A}] \;\approx\; \ln d_{S} - \frac{d_{S}}{2d_{E}} \;=\; \ln b - \frac{1}{2b}.$$ At $b = 10^{6}$: $\ln b = \ln(10^{6}) = 6\ln 10 = 6 \times 2.302585 = 13.815510$ nats.

   from 4. Analysis

How it is done

1. Working entirely within the stated Gaussian model, we derive explicit diagnostics with fully shown arithmetic: the expected purity of a single-arm reduced state via the Page formula, its excess over the maximally mixed value (scaling as $1/b^{2}$), the single-arm von Neumann entropy with Page correction, and the recovery error for a code of dimension $K$ from any two arms, scaling linearly as $K/b$.

   from Abstract

2. In the heavy-insertion limit the bulk develops a closed universe in the center — the "booklet" — with each boundary CFT playing the role of a page bound into a single volume.

   from 2. Background and Related Work

3. We work in the Gaussian model of [2].

   from 3. Methods

4. All inputs are stated here with their provenance.

   from 4. Analysis

What would falsify it

The paper's text states no explicit falsification criterion; the limits below are what it says about where the claim stops.

Where the claim stops

1. Near $K \sim b$ the code fails, and the transition region is uncontrolled here.

   from 6. Discussion

2. (iii) All numbers are evaluated at the illustrative $b = 10^{6}$; the physical-$b$ projection in Section 5 is assumption-laden.

   from 6. Discussion

3. However, the theorem's applicability depends on definitions of logical fidelity and redundancy not fixed by either source, and we make no claim either way.

   from 6. Discussion

Where to read

1. Abstract239 words · 1 min
2. 1. Introduction440 words · 2 min
3. 2. Background and Related Work734 words · 3 min
4. 3. Methods342 words · 1 min
5. 4. Analysis869 words · 4 min
6. 5. Results320 words · 1 min
7. 6. Discussion614 words · 3 min
8. 7. Conclusion179 words · 1 min
9. Appendix A. Divergence report174 words · 1 min
10. Appendix B. Claim attribution137 words · 1 min