Code Subspaces, Logical Algebras, and Encoding Maps
A holographic recovery claim is defined only after fixing three objects: a code domain of low-energy states, a logical algebra of gauge-invariant bulk observables, and an encoding into the boundary physical Hilbert space. These choices determine whether “reconstruction” means an exact intertwining relation, an approximation in a named norm, or merely agreement of selected correlators. A global tensor factorization of the bulk Hilbert space is neither required nor generally available.
Required background. Operator-Algebra Quantum Error Correction supplies correctable-algebra conditions. Choosing a Continuum Subsystem: Algebra, Split, or Regulator supplies the continuum subsystem choices.
Helpful background. Error Models, Codes, and Recovery Conditions fixes the recovery task. Entanglement-Wedge Reconstruction gives the holographic target. Channel–State Correspondence in Infinite Dimensions explains why finite-dimensional Choi manipulations need qualifications.
The code-domain triple
Section titled “The code-domain triple”Let project onto a code subspace and let
be an isometric encoding. In gravity, is normally a perturbative state space around a chosen semiclassical background, not the complete bulk Hilbert space. Its definition must state the energy cutoff , allowed particle number, asymptotic charges, topology and black-hole sector, and accuracy in , , and Kaluza–Klein truncation.
The logical object is a von Neumann algebra , not automatically the full matrix algebra . Its center can record superselection or area-sector data. For a boundary region , restriction is a channel or algebra inclusion ; in a regulated factorization one may write
An operator is reconstructible on if there exists in the physical region algebra such that . Approximate reconstruction must replace this equality by a state-uniform norm or an energy-constrained channel distance.
This separation was already essential in the original holographic QEC formulation: the same perturbative bulk operator can have different boundary representatives only on a restricted low-energy sector Almheiri, Dong, and Harlow 2015. Operator-algebra QEC then makes the reconstructible algebra, rather than a fictitious factor, primary Harlow 2017.
A finite low-energy model
Section titled “A finite low-energy model”Choose a background and two orthogonal, gravitationally dressed one-particle wavepackets and , all with energies below . Define
For a wedge containing packet 1 but not packet 2, a sensible logical algebra is generated by the number and bounded transition operators of mode 1 together with any declared central charge sector. It is not : an operator that interchanges the two wavepackets is not localized in that wedge. The boundary restriction map can be tested on the nine matrix units ; this finite basis turns an abstract claim into a reproducible channel comparison.
If is extracted perturbatively from boundary correlators, normalization requires
where is the backreaction scale. This is a controlled isometry statement only on the declared span.
First application
Section titled “First application”Take the three-state code above and a boundary region . Compute the matrices
To test recovery of the mode-1 algebra, solve for a completely positive unital adjoint map whose action satisfies
The report includes the dressing anchor, center sector, , state basis, norm, and . It thereby distinguishes a recovered algebra from agreement of one two-point function.
Adversarial control
Section titled “Adversarial control”Enlarge the code by adding states with energy, distinct black-hole microcanonical bands, or a different asymptotic charge. The Gram matrix can cease to be perturbatively close to the identity, the wedge can move, and an operator that preserved the old code can leak out of the new one. A recovery channel optimized on the three-state span need not have any small error on the enlarged domain.
This control falsifies the common shortcut of treating as “all semiclassical states.” The strongest surviving claim is tied to a named sector and energy window.
Regime, evidence ceiling, and handoff
Section titled “Regime, evidence ceiling, and handoff”At large , controls perturbative gravity; controls string corrections; the compactification scale controls omitted KK modes. Code dimension and energy must remain low enough that accumulated errors and backreaction do not compete with the leading wedge data. At finite , continuum algebras and gravitational constraints make an exact factorization especially suspect.
The evidence ceiling is an encoding and recovery statement on a specified domain. It is not a construction of the full quantum-gravity Hilbert space. Continue to Exact Toy-Code Reconstruction Theorems for an exact finite-dimensional example and to Continuum Factorization and Type-III Obstacles for the continuum obstruction.
The chapter overview contains the structure diagram and validity and failure diagram. They are embedded there once so that their shared chapter-level context is not repeated on every article.
For the chapter-wide comparison of assumptions, counterevidence, falsifiers, and claim ceilings, see the claim-domain table.
References
Section titled “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.
- Harlow, D. (2017), “The Ryu–Takayanagi Formula from Quantum Error Correction,” Communications in Mathematical Physics 354, 865–912. DOI; arXiv:1607.03901.
- Kribs, D. W., Laflamme, R., Poulin, D., and Lesosky, M. (2006), “Operator Quantum Error Correction,” Quantum Information & Computation 6, 382–399. arXiv:quant-ph/0504189.