Papers
Topics
Authors
Recent
Search
2000 character limit reached

Angular $k$-uniformity and the Hyperinvariance of Holographic Codes

Published 6 Jun 2025 in hep-th and quant-ph | (2506.06577v1)

Abstract: Holographic quantum error-correcting codes, often realized through tensor network architectures, have emerged as compelling toy models for exploring bulk-boundary duality in AdS-CFT. By encoding bulk information into highly entangled boundary degrees of freedom, they capture key features of holography such as subregion duality, operator reconstruction, and complementary recovery. Among them, hyperinvariant tensor networks-characterized by the inclusion of edge tensors and the enforcement of multi-tensor isometries-offer a promising platform for realizing features such as state dependence and nontrivial boundary correlations. However, existing constructions are largely confined to two-dimensional regular tilings, and the structural principles underlying hyperinvariance remain poorly understood, especially in higher dimensions. To address this, we introduce a geometric criterion called angular k-uniformity, which refines standard k-uniformity and its planar variants by requiring isometric behavior within angular sectors of a tensor's rotationally symmetric layout. This condition enables the systematic identification and construction of hyperinvariant holographic codes on regular hyperbolic honeycombs in arbitrary dimension, and extends naturally to heterogeneous networks and qLEGO architectures beyond regular tilings. Altogether, angular k-uniformity provides a versatile, geometry-aware framework for analyzing and designing holographic tensor networks and codes with hyperinvariant features such as nontrivial boundary correlations and state-dependent complementary recovery.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.