On infinite tensor networks, complementary recovery and type II factors
Open accessAbstract
We initiate a study of local operator algebras at the boundary of infinite tensor networks, using the mathematical theory of inductive limits. In particular, we consider tensor networks in which each layer acts as a quantum code with complementary recovery, a property that features prominently in the bulk-to-boundary maps intrinsic to holographic quantum error-correcting codes. In this case, we decompose the limiting Hilbert space and the algebras of observables in a way that keeps track of the entanglement in the network. As a specific example, we describe this inductive limit for the holographic Harlow-Pastawski-Preskill-Yoshida code model and relate its algebraic and error-correction features. We find that the local algebras in this model are given by the hyperfinite type II ∞ factor. Next, we discuss other networks that build upon this framework and comment on a connection between type II factors and stabilizer circuits. We conclude with a discussion of multiscale entanglement renormalization ansatz networks in which complementary recovery is broken. We argue that this breaking possibly permits a limiting type III von Neumann algebra, making them more suitable ansätze for approximating subregions of quantum field theories.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Recent work has proposed to weaken the entanglement structure of known holographic codes in order to capture algebraic properties of the boundary theory in an inductive limit, as the HaPPY code construction alone would be in violation of Lorentz symmetry.
“Recent work has proposed to weaken the entanglement structure of known holographic codes in order to capture algebraic properties of the boundary theory in an inductive limit [7], as the HaPPY code construction alone would be in violation of Lorentz symmetry.”
From Hyperinvariant spin network states — an AdS/CFT model from first principles (2026) · cites this paper as [7]
The citation lists haven’t been fetched yet
References 60 · Cited by 1
- Authors
- Chemissany, W., Gesteau, E., Jahn, A., Murphy, D., & Shaposhnik, L.
- Affiliations
- University of Pennsylvania (US)
- California Institute of Technology (US)
- Freie Universität Berlin (DE)
- Corresponding author
- Chemissany, Wissam
- Gesteau, Elliott
- Jahn, Alexander
- Murphy, Daniel
- Shaposhnik, Leo
- Venue
- Journal of Physics A: Mathematical and Theoretical
- Publisher
- IOP Publishing
- Published
- 2025-10-23
- Volume
- 58
- Issue
- 43
- Pages
- 435301
- ISSN
- 1751-8113 (ISSN-L)
- 1751-8121
- OpenAlex
- W4414763716
- Cited by
- 1
- References
- 60
- Citations by year
- 2026: 1
- FWCI
- 0.36
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- Locations
- Journal of Physics A Mathematical and Theoretical (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- Refubium (Universitätsbibliothek der Freien Universität Berlin) (submittedVersion, cc-by)
- arXiv (Cornell University)
- Universitätsbibliothek der FU Berlin Hochschulschriftenstelle u. Dokumentenserver (cc-by)
- Funders
- High Energy Physics (DE-SC0018407)
- Berlin Quantum
- Einstein Research Unit (Perspectives of a quantum digital transformation)
- California Institute of Technology (Todd Alworth Larson fellowship)
- Division of Astronomical Sciences (PHY-2309135)
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Mathematics › Mathematical Physics › Advanced Operator Algebra Research
- Physical Sciences › Physics and Astronomy › Nuclear and High Energy Physics › Black Holes and Theoretical Physics
- Keywords
- inductive limits, type II factors, type III von Neumann algebras, stabilizer circuits, multiscale entanglement renormalization ansatz, entanglement
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review