Entanglement Wedges and Holographic Quantum Error Correction
Entanglement-wedge reconstruction interprets redundant bulk encoding as quantum error correction. Exact toy codes, semiclassical bulk relations, and approximate finite-N recovery establish different levels of that interpretation.
Enter this chapter
Section titled “Enter this chapter”Begin with Entanglement-Wedge Reconstruction to locate the bulk region associated with a specified boundary subregion.
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.
Topics
Section titled “Topics”- Entanglement-Wedge Reconstruction — Distinguishes causal support from wedge recovery and states the limitations of the semiclassical result.
- Code Subspaces, Logical Algebras, and Encoding Maps — Defines the state domain, physical encoding, region restriction, and logical algebra.
- Exact Toy-Code Reconstruction Theorems — Proves one-qutrit erasure correction and bounds the holographic analogy.
- Leading Semiclassical JLMS and Code-Subspace Claims — Derives relative-entropy matching and its recovery implication.
- Complementary Recovery, Area Terms, and Center Data — Shows how central sector data and RT-form entropies arise in exact algebraic codes.
- Holographic Quantum Error Correction — Synthesizes boundary erasure, redundant reconstruction, and gravitational assumptions.
- Approximate Finite-N Recovery, Alpha-Bits, and Error Bounds — Defines operational errors and entropy-scaled subspace tasks.
- Holographic-QEC Algebras, Centers, and Gravitational Edge Data — Fixes dressing, charges, centers, and large- algebra types.
- Continuum Factorization and Type-III Obstacles — Replaces sharp tensor factors by algebras, split inclusions, or regulators.
- Non-Isometric Encoding Proposals — Tests kernels, approximate isometry, postselection, and state dependence.
- QEC Evidence, Current Disputes, and Status — Gives the dated 2026 claim matrix and update triggers.
How the ideas fit together
Section titled “How the ideas fit together”A code sector limits which bulk states and logical observables the reconstruction must preserve. Operator-algebra error correction explains how different boundary representatives can act identically on that sector while retaining center data associated with geometric terms Harlow 2017, §§ 2–4.
Redundant representation does not create independent copies of an unknown quantum state. At finite N, recovery additionally needs an error norm and a controlled domain; gravitational dressing and continuum factorization can obstruct naive tensor-factor arguments. Non-isometric proposals introduce further assumptions and should not inherit exact finite-dimensional guarantees.
The comparison below separates the assumptions and tests needed for these different conclusions.
Claim-domain comparison
Section titled “Claim-domain comparison”| 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. | For at least one allowed code input, the claimed exact erasure-recovery map fails the recovery identity. | Promoting a theorem about a finite toy code to 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. | For states in the declared code sector, boundary and bulk relative entropies disagree beyond the retained-order error with the area and center terms matched. | Promoting leading-order algebraic reconstruction to an 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. | The specified recovery map exceeds its claimed error bound in the declared operator class and norm; failure of one map alone does not exclude every alternative. | Treating one approximate framework as consensus on a shared logical algebra. | an explicit approximate statement |
Download this comparison as JSON
Where to go next
Section titled “Where to go next”Continue to Holographic Complexity Proposals and Diagnostics to compare proposed geometric measures of computational cost with explicitly defined boundary tasks.
References
Section titled “References”- Harlow, D. (2017), “The Ryu–Takayanagi Formula from Quantum Error Correction,” Communications in Mathematical Physics 354, 865–912. DOI; arXiv:1607.03901.