Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Prespacetime journal

TGD View on Holography & Quantum Error Correcting Codes

Matti Pitkänen

Published Apr 23, 2016• 0 citations
OpenAlex

Abstract

Preskill et. al. suggest a highly interesting representation of holography in terms of quantum error correction codes The idea is that time= constant section of AdS, which is hyperbolic space allowing tessellations, can define tensor networks. So called perfect tensors are building bricks of the tensor networks providing representation for holography and at the same time defining error correcting codes by mapping localized interior states (logical qubits) to highly entangled non-local boundary states (physical qubits). There are three observations that put bells ringing and actually motivated this article.

Related papers

Holography, cellulations and error correcting codes

Marika Taylor, Woodward, Charles

Quantum error correction codes associated with the hyperbolic plane have been explored extensively in the context of the AdS$_3$/CFT$_2$ correspondence. In this paper we initiate a systematic study of codes associated with holographic geometries in higher dimensions, relating cellulations of the spatial sections of the geometries to stabiliser codes. We construct analogues of the HaPPY code for three-dimensional hyperbolic space (AdS$_4$), using both absolutely maximally entangled (AME) and non-AME codes. These codes are based on uniform regular tessellations of hyperbolic space but we note that AME codes that preserve the discrete symmetry of the polytope of the tessellation do not exist above two dimensions. We also explore different constructions of stabiliser codes for hyperbolic spaces in which the logical information is associated with the boundary and discuss their potential interpretation. We explain how our codes could be applied to interesting classes of holographic dualities based on gravity-scalar theories (such as JT gravity) through toroidal reductions of hyperbolic spaces.

arXiv:2112.12468•Dec 23, 2021•2 citations

Holographic quantum error-correcting codes: toy models for the bulk/boundary correspondence

Fernando Pastawski, Beni Yoshida, Daniel Harlow +1 more

We propose a family of exactly solvable toy models for the AdS/CFT correspondence based on a novel construction of quantum error-correcting codes with a tensor network structure. Our building block is a special type of tensor with maximal entanglement along any bipartition, which gives rise to an isometry from the bulk Hilbert space to the boundary Hilbert space. The entire tensor network is an encoder for a quantum error-correcting code, where the bulk and boundary degrees of freedom may be identified as logical and physical degrees of freedom respectively. These models capture key features of entanglement in the AdS/CFT correspondence; in particular, the Ryu-Takayanagi formula and the negativity of tripartite information are obeyed exactly in many cases. That bulk logical operators can be represented on multiple boundary regions mimics the Rindlerwedge reconstruction of boundary operators from bulk operators, realizing explicitly the quantum error-correcting features of AdS/CFT recently proposed in [1].

arXiv:1503.06237•Journal of High Energy Physics•Jun 1, 2015•958 citations

A Holographic Quantum Code

Grant Elliot

Abstract: It was shown by [2] how bulk operators in the AdS/CFT correspondence can be represented on the boundary analogously to the way logical qubits are represented in an encoded subspace in quantum error correction. Then in [1] holographic tensor networks that serve as toy models of the bulk boundary. This paper reviews some of the developments of [1] and [2]. Then it is demonstrated explicitly how to construct perfect tensors, which are essential to the tensor networks mentioned in [2]. Lastly a new example of a holographic quantum error-correcting code based on an eight index perfect tensor is presented.

UF Journal of Undergraduate Research•Feb 27, 2019•0 citations

Approximate Bacon-Shor code and holography

ChunJun Cao

We explicitly construct a class of holographic quantum error correction codes with non-trivial centers in the code subalgebra. Specifically, we use the Bacon-Shor codes and perfect tensors to construct a gauge code (or a stabilizer code with gauge-fixing), which we call the holographic hybrid code. This code admits a local log-depth encoding/decoding circuit, and can be represented as a holographic tensor network which satisfies an analog of the Ryu-Takayanagi formula and reproduces features of the sub-region duality. We then construct approximate versions of the holographic hybrid codes by “skewing” the code subspace, where the size of skewing is analogous to the size of the gravitational constant in holography. These approximate hybrid codes are not necessarily stabilizer codes, but they can be expressed as the superposition of holographic tensor networks that are stabilizer codes. For such constructions, different logical states, representing different bulk matter content, can “back-react” on the emergent geometry, resembling a key feature of gravity. The locality of the bulk degrees of freedom becomes subspace-dependent and approximate. Such subspace-dependence is manifest from the point of view of the “entanglement wedge” and bulk operator reconstruction from the boundary. Exact complementary error correction breaks down for certain bipartition of the boundary degrees of freedom; however, a limited, state-dependent form is preserved for particular subspaces. We also construct an example where the connected two-point correlation functions can have a power-law decay. Coupled with known constraints from holography, a weakly back-reacting bulk also forces these skewed tensor network models to the “large N limit” where they are built by concatenating a large N number of copies.

•Jul 10, 2023•19 citations

Approximate Bacon-Shor code and holography

ChunJun Cao, Brad Lackey

Abstract We explicitly construct a class of holographic quantum error correction codes with non-trivial centers in the code subalgebra. Specifically, we use the Bacon-Shor codes and perfect tensors to construct a gauge code (or a stabilizer code with gauge-fixing), which we call the holographic hybrid code. This code admits a local log-depth encoding/decoding circuit, and can be represented as a holographic tensor network which satisfies an analog of the Ryu-Takayanagi formula and reproduces features of the sub-region duality. We then construct approximate versions of the holographic hybrid codes by “skewing” the code subspace, where the size of skewing is analogous to the size of the gravitational constant in holography. These approximate hybrid codes are not necessarily stabilizer codes, but they can be expressed as the superposition of holographic tensor networks that are stabilizer codes. For such constructions, different logical states, representing different bulk matter content, can “back-react” on the emergent geometry, resembling a key feature of gravity. The locality of the bulk degrees of freedom becomes subspace-dependent and approximate. Such subspace-dependence is manifest from the point of view of the “entanglement wedge” and bulk operator reconstruction from the boundary. Exact complementary error correction breaks down for certain bipartition of the boundary degrees of freedom; however, a limited, state-dependent form is preserved for particular subspaces. We also construct an example where the connected two-point correlation functions can have a power-law decay. Coupled with known constraints from holography, a weakly back-reacting bulk also forces these skewed tensor network models to the “large N limit” where they are built by concatenating a large N number of copies.

arXiv:2010.05960•Journal of High Energy Physics•May 1, 2021•25 citations

Holography and criticality in matchgate tensor networks

A. Jahn, Marek Gluza, Fernando Pastawski +1 more

The AdS/CFT correspondence conjectures a holographic duality between gravity in a bulk space and a critical quantum field theory on its boundary. Tensor networks have come to provide toy models to understand these bulk-boundary correspondences, shedding light on connections between geometry and entanglement. We introduce a versatile and efficient framework for studying tensor networks, extending previous tools for Gaussian matchgate tensors in 1 + 1 dimensions. Using regular bulk tilings, we show that the critical Ising theory can be realized on the boundary of both flat and hyperbolic bulk lattices, obtaining highly accurate critical data. Within our framework, we also produce translation-invariant critical states by an efficiently contractible tensor network with the geometry of the multiscale entanglement renormalization ansatz. Furthermore, we establish a link between holographic quantum error-correcting codes and tensor networks. This work is expected to stimulate a more comprehensive study of tensor network models capturing bulk-boundary correspondences.

arXiv:1711.03109•Science Advances•Aug 2, 2019•42 citations
Preskill et. al. suggest a highly interesting representation of holography in terms of quantum error correction codes The idea is that time= constant section of AdS, which is hyperbolic space allowing tessellations, can define tensor networks. So called perfect tensors are building bricks of the tensor networks providing representation for holography and at the same time defining error correcting codes by mapping localized interior states (logical qubits) to highly entangled non-local boundary states (physical qubits). There are three observations that put bells ringing and actually motivated this article.
Quantum error correction codes associated with the hyperbolic plane have been explored extensively in the context of the AdS3_33​/CFT2_22​ correspondence. In this paper we initiate a systematic study of codes associated with holographic geometries in higher dimensions, relating cellulations of the spatial sections of the geometries to stabiliser codes. We construct analogues of the HaPPY code for three-dimensional hyperbolic space (AdS4_44​), using both absolutely maximally entangled (AME) and non-AME codes. These codes are based on uniform regular tessellations of hyperbolic space but we note that AME codes that preserve the discrete symmetry of the polytope of the tessellation do not exist above two dimensions. We also explore different constructions of stabiliser codes for hyperbolic spaces in which the logical information is associated with the boundary and discuss their potential interpretation. We explain how our codes could be applied to interesting classes of holographic dualities based on gravity-scalar theories (such as JT gravity) through toroidal reductions of hyperbolic spaces.
We propose a family of exactly solvable toy models for the AdS/CFT correspondence based on a novel construction of quantum error-correcting codes with a tensor network structure. Our building block is a special type of tensor with maximal entanglement along any bipartition, which gives rise to an isometry from the bulk Hilbert space to the boundary Hilbert space. The entire tensor network is an encoder for a quantum error-correcting code, where the bulk and boundary degrees of freedom may be identified as logical and physical degrees of freedom respectively. These models capture key features of entanglement in the AdS/CFT correspondence; in particular, the Ryu-Takayanagi formula and the negativity of tripartite information are obeyed exactly in many cases. That bulk logical operators can be represented on multiple boundary regions mimics the Rindlerwedge reconstruction of boundary operators from bulk operators, realizing explicitly the quantum error-correcting features of AdS/CFT recently proposed in [1].
Abstract: It was shown by [2] how bulk operators in the AdS/CFT correspondence can be represented on the boundary analogously to the way logical qubits are represented in an encoded subspace in quantum error correction. Then in [1] holographic tensor networks that serve as toy models of the bulk boundary. This paper reviews some of the developments of [1] and [2]. Then it is demonstrated explicitly how to construct perfect tensors, which are essential to the tensor networks mentioned in [2]. Lastly a new example of a holographic quantum error-correcting code based on an eight index perfect tensor is presented.
We explicitly construct a class of holographic quantum error correction codes with non-trivial centers in the code subalgebra. Specifically, we use the Bacon-Shor codes and perfect tensors to construct a gauge code (or a stabilizer code with gauge-fixing), which we call the holographic hybrid code. This code admits a local log-depth encoding/decoding circuit, and can be represented as a holographic tensor network which satisfies an analog of the Ryu-Takayanagi formula and reproduces features of the sub-region duality. We then construct approximate versions of the holographic hybrid codes by “skewing” the code subspace, where the size of skewing is analogous to the size of the gravitational constant in holography. These approximate hybrid codes are not necessarily stabilizer codes, but they can be expressed as the superposition of holographic tensor networks that are stabilizer codes. For such constructions, different logical states, representing different bulk matter content, can “back-react” on the emergent geometry, resembling a key feature of gravity. The locality of the bulk degrees of freedom becomes subspace-dependent and approximate. Such subspace-dependence is manifest from the point of view of the “entanglement wedge” and bulk operator reconstruction from the boundary. Exact complementary error correction breaks down for certain bipartition of the boundary degrees of freedom; however, a limited, state-dependent form is preserved for particular subspaces. We also construct an example where the connected two-point correlation functions can have a power-law decay. Coupled with known constraints from holography, a weakly back-reacting bulk also forces these skewed tensor network models to the “large N limit” where they are built by concatenating a large N number of copies.
Abstract We explicitly construct a class of holographic quantum error correction codes with non-trivial centers in the code subalgebra. Specifically, we use the Bacon-Shor codes and perfect tensors to construct a gauge code (or a stabilizer code with gauge-fixing), which we call the holographic hybrid code. This code admits a local log-depth encoding/decoding circuit, and can be represented as a holographic tensor network which satisfies an analog of the Ryu-Takayanagi formula and reproduces features of the sub-region duality. We then construct approximate versions of the holographic hybrid codes by “skewing” the code subspace, where the size of skewing is analogous to the size of the gravitational constant in holography. These approximate hybrid codes are not necessarily stabilizer codes, but they can be expressed as the superposition of holographic tensor networks that are stabilizer codes. For such constructions, different logical states, representing different bulk matter content, can “back-react” on the emergent geometry, resembling a key feature of gravity. The locality of the bulk degrees of freedom becomes subspace-dependent and approximate. Such subspace-dependence is manifest from the point of view of the “entanglement wedge” and bulk operator reconstruction from the boundary. Exact complementary error correction breaks down for certain bipartition of the boundary degrees of freedom; however, a limited, state-dependent form is preserved for particular subspaces. We also construct an example where the connected two-point correlation functions can have a power-law decay. Coupled with known constraints from holography, a weakly back-reacting bulk also forces these skewed tensor network models to the “large N limit” where they are built by concatenating a large N number of copies.
The AdS/CFT correspondence conjectures a holographic duality between gravity in a bulk space and a critical quantum field theory on its boundary. Tensor networks have come to provide toy models to understand these bulk-boundary correspondences, shedding light on connections between geometry and entanglement. We introduce a versatile and efficient framework for studying tensor networks, extending previous tools for Gaussian matchgate tensors in 1 + 1 dimensions. Using regular bulk tilings, we show that the critical Ising theory can be realized on the boundary of both flat and hyperbolic bulk lattices, obtaining highly accurate critical data. Within our framework, we also produce translation-invariant critical states by an efficiently contractible tensor network with the geometry of the multiscale entanglement renormalization ansatz. Furthermore, we establish a link between holographic quantum error-correcting codes and tensor networks. This work is expected to stimulate a more comprehensive study of tensor network models capturing bulk-boundary correspondences.