Read a holography paper through a small calculable model
Sandbox Physics ·
A small model lets you finish a step that appears in a paper: integrate a curve, erase a subsystem or recover a state with a complex phase. Follow the inputs all the way to the output, then identify which further claims require theoretical assumptions. That makes the result easier to interpret and the next question easier to ask.
Begin with a result whose parameters you can specify
Open section II of Ryu and Takayanagi’s 2006 paper. Equation (9) gives the distance between two cutoff endpoints in global AdS3. Equation (10) takes the large-cutoff limit and compares with interval entropy on a circle. Record the radius, radial coordinate and interval fraction before substituting. Its hyperbolic radial coordinate differs from the bounded radial angle of Chapter 1.
For a concrete check, choose the paper’s hyperbolic radius r0=2 and angular separation Δϕ=π/3. Equation (9) gives cosh(L/L)=1+2sinh2(r0)sin2(Δϕ/2). Independently embed both endpoints in a hyperboloid and calculate the distance from their Minkowski inner product. The two methods use identical endpoints.
The Poincaré Lab fixes equal-height cutoff anchors instead. At finite cutoff these differ from boundary-anchored arcs clipped afterward, although both approach the same continuum logarithm. A reproduction should separate the source check, the Lab convention and their common limit. Match endpoint conditions before interpreting a discrepancy as integration error.
The embedding inner product has signs minus, plus, plus. This computes a distance on an equal-time hyperbolic plane, distinct from the spacetime interval used for light propagation.
Follow both interval candidates through their crossing
Figure 1 in Headrick’s section 4.2 shows two endpoint pairings. Equations (38)–(42) turn their total lengths into mutual information. Keep equal interval sizes and scan only their gap. Plotting both candidates before selecting the minimum helps reveal mistakes in endpoint ordering, cutoff conventions or branch choice.
Set each interval width to one. At gap 1/4, the leading continuum result is I/c=(1/3)log(16/9)≃0.191788. At gap 1/2, it vanishes at leading order. Also scan near d=2−1 to check the candidate crossing. A finite-cutoff geometric crossing shifts slightly and should converge toward this threshold as the cutoff shrinks.
This reproduces one analytic prediction, without solving replica saddles or finding the exact entropy of a CFT at arbitrary central charge. The discussion after equation (42) explains that subleading correlations can survive a vanishing leading mutual information. That observation determines what the zero on the plot means.
Appendix A.1 of Pastawski and colleagues gives the five-qubit stabilizers and logical operators. Construct two orthogonal codewords from their common eigenspace. For every erasure set, trace out the lost sites and apply recovery. Positions around the pentagon label tensor factors; their drawn distances do not enter the quantum channel.
Testing only logical zero and one is insufficient. A channel that discards all coherence can pass both tests. Check ∣+⟩ and ∣+i⟩ too, or entangle the logical input with an external reference qubit. Preserving the complete reference–logical joint state tests preservation of arbitrary superpositions and external correlations.
Save complex input amplitudes, erased sites, the retained density matrix and the reconstructed state. Recalculate F=⟨ψ∣ρrec∣ψ⟩ from those matrices. Assigning fidelity one from an erasure-count label would skip the recovery calculation. The exhaustive calculation is deterministic and needs no seed; additional sampled inputs need a saved seed and sampling rule.
∣Φ⟩RL=2∣00⟩+∣11⟩,(idR⊗R∘N)(∣Φ⟩⟨Φ∣)=∣Φ⟩⟨Φ∣
This identity holds for correctable erasure sets. Compare the whole matrix, including imaginary and off-diagonal components.
For this five-qubit code, any retained pair contains no information about the logical state. Change the input from logical zero to one, then change its phase: the retained state is unchanged. Any recovery device given only that state must return the same output for these different inputs, so it cannot recover all of them. This failure follows directly from the channel.
Now redraw the five nodes at arbitrary positions without changing the encoding. Recovery performance stays identical. Display coordinates therefore do not define a continuous spatial metric. The code supplies isometry, secret sharing and redundant operator representations. It does not supply a local Hamiltonian, distance-dependent CFT correlations or Einstein dynamics. A full HaPPY network requires more tensors and specified contractions; continuous AdS/CFT needs further physical structure.
These failures suggest useful research questions. Add one structure, such as network size or approximate encoding error, define an observable and test whether it approaches a continuous result. Success in a finite example answers the channel question that was actually tested.
Integrals and causal equations test fixed-background geometry. Matrix identities and recovery errors test a finite encoding. A gravitational correspondence requires structure on both the field-theory and gravity sides. Our figures show calculated model quantities or explicitly labeled schematics; none are detector measurements. Black-hole microstates and gravitational path integrals remain paper-reading topics.
You can now start from a boundary interval, derive a curve, remove a cutoff and compare candidates. You can also encode a logical state, erase sites and reconstruct it. When a new paper changes one step of that chain, identify the step first. A precise question makes its new conclusion easier to connect to a calculation you already understand.
Fix interval width to one and compare gaps one quarter and one half. Record leading continuum mutual information and finite-cutoff candidate lengths separately.
Reduce the cutoff and track the candidate crossing toward its continuum value. Save the calculation and state the endpoint convention.
Choose an input with an imaginary amplitude, erase two sites and save a recovery record. Compare off-diagonal matrix entries.
Erase a third site and repeat with different inputs. Explain why high fidelity for a few states is weaker than arbitrary-state recovery.
Exercises and explanations
Keep the encoding matrix fixed and redraw the five boundary sites on a line. Which results change?
Read the explanation
The drawing and visual notion of proximity change. Partial traces, recovered matrices and fidelities depend on tensor factors and erasure sets, so they do not. Position-dependent dynamics requires an additional interaction or network rule.
Why is agreement between a numerical integral and an analytic formula insufficient to reproduce a whole holography paper?
Read the explanation
It checks a length for specified metric, endpoints and cutoff. The CFT, gravitational effective action, quantum corrections and other saddles were not computed by that comparison. Name the reproduction after the steps actually completed.
The course derives its worked examples and draws its own schematics. The numerical references recalculate specified analytic geometry and a finite five-qubit encoding. The source locations below distinguish those calculations from theoretical reading topics.
Sections 3.1–3.3: global and Poincaré coordinates, fixed-background fields, source boundary conditions and dynamical gravity; section 4.1: conditions for a CFT with a weakly coupled bulk description. The course derives its radial optical paths and scalar near-boundary exponents from these metrics and field equations.
Equation (5), static area prescription; equations (6)–(10) and Figure 1, vacuum AdS3 interval geometry and the circle result. We independently integrate the Poincaré geodesic and compare regulator limits. Our equal-height finite-cutoff anchors are a separately defined geometric diagnostic. Multiple-interval minima use Headrick, not equation (12) of this early paper.
Sections 3.1.3 and 4.2, especially Figure 1: the two homologous pairings for two vacuum intervals, their transition and leading mutual information. We recalculate the equal-length specialization as the gap is varied; no numerical replica saddles or source artwork are reproduced.
Section 2 defines perfect tensors; Appendix A.1, equations (30)–(32), supplies the five-qubit code. We construct one tensor from its stabilizers and recalculate known-erasure recovery. The browser does not build the many-pentagon network or reproduce its greedy thresholds.
Sections 3–4: the code-subspace interpretation of bulk reconstruction and quantum secret sharing. Used for the conceptual operator discussion, not claimed as a numerical reproduction of a CFT.
Sections I–II and Figure 1 define causal and entanglement wedges and a perturbative code subspace. Sections III–IV state the relative-entropy assumptions behind reconstruction. We explain these assumptions; the finite code checks are a separate exact model.
Keep reading
What this page links to directly
You are hereRead a holography paper through a small calculable model