Entanglement Wedges and Holographic Quantum Error Correction

Entanglement-wedge recovery is meaningful only after one names the boundary region, code domain, logical algebra, gravitational dressing, error metric, $N$ regime, and encoding status. This chapter separates exact finite-dimensional codes from leading semiclassical JLMS recovery, center-aware operator-algebra QEC, approximate finite-$N$ and alpha-bit tasks, continuum and gravitational obstructions, and non-isometric proposals. Its central discipline is that none of these layers silently inherits the strongest status of another.

Helpful background. Operator-Algebra Quantum Error Correction supplies exact algebraic recovery. Approximate Recovery and Information–Disturbance supplies error metrics. Finite N, Horizons, State Dependence, and Reconstruction Limits supplies the nonperturbative ceiling. Entanglement Wedges, Nesting, and Information Inequalities and Boundary Relative Entropy and Bulk Modular Data supply the geometric and modular inputs.

Enter this chapter

QEC-first readers should begin with the code-domain and exact-toy pages, then move through complementary and approximate recovery. Gravity-first readers should begin with entanglement-wedge reconstruction and JLMS, but must specify dressing and code limits before using QEC conclusions. The chapter owns the holographic instantiation and its status boundaries; abstract QEC remains in Volume XIII, perturbative HKLL in the reconstruction chapter, and entropy geometry in the entanglement chapter.

Check your preparation by asking whether you can:

• distinguish recovery of a von Neumann algebra from recovery of an entire tensor factor;
• state why a causal wedge can be smaller than an entanglement wedge;
• use relative-entropy data processing to diagnose information loss;
• explain why gravity needs dressed observables and why sharp QFT regions are not Hilbert-space factors; and
• attach a trace, fidelity, operator, or energy-constrained diamond error to an approximate claim.

If any item fails, use the linked background owner before proceeding. There is no meaningful chapter-wide score: each missing capability routes to a different repair.

Choose a route

Goal	Reading route	Capability at the exit
First graduate encounter	Wedge reconstruction → code subspaces → toy theorem → JLMS → holographic QEC	State the conditional code interpretation without upgrading it to exact gravity
Algebra and entropy	JLMS → complementary recovery → gravitational algebras → Type III	Track centers, area terms, dressing, and continuum limits
Finite-$N$ research re-entry	Approximate recovery → non-isometric proposals → status page	Compare live claims using one code, algebra, and error metric
Exact proof	Code subspaces → toy theorem → complementary recovery	Verify an access structure and identify every absent gravitational hypothesis

Exact chapter guide

1. Entanglement-Wedge Reconstruction distinguishes causal support from wedge recovery and states the semiclassical evidence ceiling.
2. Code Subspaces, Logical Algebras, and Encoding Maps defines the state domain, physical encoding, region restriction, and logical algebra.
3. Exact Toy-Code Reconstruction Theorems proves one-qutrit erasure correction and bounds the holographic analogy.
4. Leading Semiclassical JLMS and Code-Subspace Claims derives relative-entropy matching and its recovery implication.
5. Complementary Recovery, Area Terms, and Center Data shows how central sector data and RT-form entropies arise in exact algebraic codes.
6. Holographic Quantum Error Correction synthesizes boundary erasure, redundant reconstruction, and gravitational assumptions.
7. Approximate Finite-N Recovery, Alpha-Bits, and Error Bounds defines operational errors and entropy-scaled subspace tasks.
8. Holographic-QEC Algebras, Centers, and Gravitational Edge Data fixes dressing, charges, centers, and large-$N$ algebra types.
9. Continuum Factorization and Type-III Obstacles replaces sharp tensor factors by algebras, split inclusions, or regulators.
10. Non-Isometric Encoding Proposals tests kernels, approximate isometry, postselection, and state dependence.
11. QEC Evidence, Current Disputes, and Status gives the dated 2026 claim matrix and update triggers.

Synthesis: six different strengths

An exact toy code proves Knill–Laflamme recovery for a finite map. JLMS supplies a leading semiclassical relative-entropy relation on a code. Operator-algebra QEC explains complementary recovery and center data. Approximate finite-$N$ recovery adds a norm, state family, and error; alpha-bits additionally constrain how code dimension scales with entropy. Gravitational algebras require dressing and charge choices, while non-isometric maps may sacrifice inner products or state independence.

The implications are one-way unless additional hypotheses are proved:

$$\text{relative-entropy control} \Longrightarrow \text{qualified recovery},$$

but recovery does not by itself select a unique wedge, dressing, area operator, or full quantum-gravity Hilbert space. Exact finite-dimensional theorems and gravitational interpretations were separated from the outset by the foundational literature Almheiri, Dong, and Harlow 2015, Harlow 2017.

At the 2026 cutoff, a finite-$N$ shared logical algebra is disputed. Approximate-code results support controlled state-dependent geometry in specified models Cao et al. 2026, while a locality and dressing argument challenges a common noncentral algebra in an ordinary finite-$N$ CFT Terashima 2026. The chapter reports the conflict rather than declaring either universal.

Review the chapter

A satisfactory answer should:

1. write an encoding, region channel, logical algebra, and exact or approximate recovery condition;
2. prove the one-erasure property of the three-qutrit code and state its access structure;
3. derive the cancellation that turns the JLMS modular relation into bulk relative entropy;
4. decompose a finite operator algebra into center sectors and derive its entropy formula;
5. distinguish an energy-constrained recovery error from an alpha-bit capacity statement;
6. explain how dressing and Type-III algebras obstruct naive factorization;
7. use singular values and kernels to test a non-isometric map; and
8. compare the 2026 finite-$N$ claim and counterclaim with identical domains and observables.

An answer fails if it calls an exact tensor-network theorem a theorem of quantum gravity, treats a leading $1/N$ relation as an exact finite-$N$ identity, identifies an area term with a universal noncentral area operator, or reports the disputed shared logical algebra as settled.

Exits

Continue to Holographic Complexity Proposals and Diagnostics for computational-protection and complexity dictionaries, or return to The Bulk Reconstruction Problem for HKLL, dressing, and state-dependence limits. The rigorous operator-algebra handoff is Algebraic Quantum Error Correction and Correctable Subalgebras.

Chapter-scale structure and validity checks

The chapter-scale structure map locates this page’s result inside the full reasoning chain. Follow the solid arrows through the declared inputs and checks; the dashed final arrow marks the point where an additional inference would be required.

Exact toy-code recovery, leading semiclassical wedge reconstruction, and finite-N holographic QEC are different statements with different algebras and errors. The diagram is an original schematic, is not to scale, and uses the dashed final arrow to mark the claim boundary.

Accessible figure data (JSON)

The companion validity map turns three common overclaims into explicit failure tests. Read each row from its declared object to the diagnostic, then compare the licensed conclusion with the dashed “not” endpoint.

Exact toy-code recovery, leading semiclassical wedge reconstruction, and finite-N holographic QEC are different statements with different algebras and errors. Each row pairs a diagnostic with the strongest supported conclusion and an explicitly unsupported promotion. The diagram is an original schematic and is not to scale.

Accessible figure data (JSON)

Claim-domain comparison

The table below gives a screen-reader-friendly comparison of three representative claims. It keeps the required declaration, approximation status, evidence timing, counterevidence, falsifier, failure condition, and licensed conclusion in one reading order.

Representative claim domains and validity boundaries for Entanglement Wedges and Holographic Quantum Error Correction

Claim object	State, ensemble, and conventions	Approximation, status, and evidence timing	Uncertainty and counterevidence	Falsifier	Failure condition	Licensed conclusion
toy tensor code	Declare finite Hilbert spaces and exact isometry; use the volume conventions unless the page states a local replacement.	Model-specific calculation or conditional result. Control chain: code subspace and algebras → encoding and recovery maps → wedge and area-center data → error norm and finite-N test → qualified QEC claim. Sources are cited on the destination page; literature checked through 10 August 2026.	Track omitted corrections, alternate branches, and competing definitions. A failed “erasure-recovery identity” check is counterevidence to the promoted claim.	erasure-recovery identity	a theorem about gravity	exact logical recovery in the model
semiclassical wedge	Declare code subspace, center, and area term; use the volume conventions unless the page states a local replacement.	Model-specific calculation or conditional result. Control chain: code subspace and algebras → encoding and recovery maps → wedge and area-center data → error norm and finite-N test → qualified QEC claim. Sources are cited on the destination page; literature checked through 10 August 2026.	Track omitted corrections, alternate branches, and competing definitions. A failed “relative entropy and complementary recovery” check is counterevidence to the promoted claim.	relative entropy and complementary recovery	exact finite-N isometry	leading-order algebraic reconstruction
finite-N recovery	Declare operator class and error norm; use the volume conventions unless the page states a local replacement.	Model-specific calculation or conditional result. Control chain: code subspace and algebras → encoding and recovery maps → wedge and area-center data → error norm and finite-N test → qualified QEC claim. Sources are cited on the destination page; literature checked through 10 August 2026.	Track omitted corrections, alternate branches, and competing definitions. A failed “optimal recovery and complement test” check is counterevidence to the promoted claim.	optimal recovery and complement test	consensus on a shared logical algebra	an explicit approximate statement

Download the structured table data (JSON).

References

• Almheiri, A., Dong, X., and Harlow, D. (2015), “Bulk Locality and Quantum Error Correction in AdS/CFT,” Journal of High Energy Physics 2015(04), 163. DOI; arXiv:1411.7041.
• Cao, C., Cheng, G., Karthikeyan, K., Li, C., and Preskill, J. (2026), “State-Dependent Geometries from Magic-Enriched Quantum Codes,” preprint, revised June 2026. arXiv:2603.13475.
• Harlow, D. (2017), “The Ryu–Takayanagi Formula from Quantum Error Correction,” Communications in Mathematical Physics 354, 865–912. DOI; arXiv:1607.03901.
• Terashima, S. (2026), “Entanglement Wedge Reconstruction without Holographic Quantum Error Correction,” preprint. arXiv:2607.08684.