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

Holographic Encoding of a Universal Turing Machine and High-Fidelity Boundary Readout

Parker Emmerson

Published Jun 26, 2026• 0 citations
Publisher

Abstract

The PV‑crystallographic hypercomputer architecture of Emmerson~\cite{EmmersonPVHPC}requires two capabilities that were left as open assumptions: (i) embedding auniversal Turing machine (UTM) into a bulk probe inside an AdS (oreffective‑cone) temporal‑compression chamber, and (ii) reading out the haltstate on the boundary with fidelity arbitrarily close to unity at the finiteexternal deadline. This paper supplies a complete, rigorous mathematicalsolution to both. We work within the holographic quantum error‑correcting code formalism,exemplified by the HaPPY perfect‑tensor network. The bulk is a negativelycurved tensor network whose boundary is a one‑dimensional spin chain. A\emph{bulk Turing probe} is defined as a designated set of bulk logicalindices that realize a universal Turing machine, with an infinite tapeextending along the radial direction and a finite‑state head. Theholographic map encodes the entire tape and head state into the boundarywith built‑in quantum error correction. A special \emph{halt tensor}inside the network encodes the answer: if the simulated program halts, alocal operation toggles the halt tensor from \(|0\rangle\) to \(|1\rangle\);otherwise it stays at \(|0\rangle\). On the boundary, the halt state becomes a logical qubit protected by aholographic code of distance \(D\). We define the \emph{crystallizationlatch} as a boundary operator \(\LL\) that measures this logical qubit. Bychoosing the network size appropriately, the effective error per measurementis exponentially small in \(D\). Consequently, for any desired targetfidelity \(1-\varepsilon\), there exists a finite tensor network and afinite readout region such that the boundary latch yields the correct haltpredicate with probability at least \(1-\varepsilon\). The proper time ofthe probe diverges as its location approaches the conformal boundary,implementing the infinite proper‑time condition exactly. The construction isfully explicit and does not rely on any new physics beyond the standardholographic duality. Thus we complete the missing link in the PV‑crystallographic hypercomputer,establishing that a bulk universal Turing machine with high‑fidelityboundary readout is mathematically consistent and can be engineered withinthe known framework of AdS/CFT.

DOI
10.5281/zenodo.20937118

Related papers

A Glassy Boundary Conformal Field Theory for Holographic Nonvolatile Storage Encoding Millions of Bits with a Single Quench

Parker Emmerson (Yaohushuason)

The PV‑crystallographic hypercomputer architecture of Emmerson~\cite{EmmersonPVHPC}requires two capabilities that were left as open assumptions: (i) embedding auniversal Turing machine (UTM) into a bulk probe inside an AdS (oreffective‑cone) temporal‑compression chamber, and (ii) reading out the haltstate on the boundary with fidelity arbitrarily close to unity at the finiteexternal deadline. This paper supplies a complete, rigorous mathematicalsolution to both. We work within the holographic quantum error‑correcting code formalism,exemplified by the HaPPY perfect‑tensor network. The bulk is a negativelycurved tensor network whose boundary is a one‑dimensional spin chain. A\emph{bulk Turing probe} is defined as a designated set of bulk logicalindices that realize a universal Turing machine, with an infinite tapeextending along the radial direction and a finite‑state head. Theholographic map encodes the entire tape and head state into the boundarywith built‑in quantum error correction. A special \emph{halt tensor}inside the network encodes the answer: if the simulated program halts, alocal operation toggles the halt tensor from \(|0\rangle\) to \(|1\rangle\);otherwise it stays at \(|0\rangle\). On the boundary, the halt state becomes a logical qubit protected by aholographic code of distance \(D\). We define the \emph{crystallizationlatch} as a boundary operator \(\LL\) that measures this logical qubit. Bychoosing the network size appropriately, the effective error per measurementis exponentially small in \(D\). Consequently, for any desired targetfidelity \(1-\varepsilon\), there exists a finite tensor network and afinite readout region such that the boundary latch yields the correct haltpredicate with probability at least \(1-\varepsilon\). The proper time ofthe probe diverges as its location approaches the conformal boundary,implementing the infinite proper‑time condition exactly. The construction isfully explicit and does not rely on any new physics beyond the standardholographic duality. Thus we complete the missing link in the PV‑crystallographic hypercomputer,establishing that a bulk universal Turing machine with high‑fidelityboundary readout is mathematically consistent and can be engineered withinthe known framework of AdS/CFT.

•Jun 26, 2026•0 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

Holographic codes from hyperinvariant tensor networks

Matthew Steinberg, Sebastian Feld, A. Jahn

Holographic quantum-error correcting codes are models of bulk/boundary dualities such as the anti-de Sitter/conformal field theory (AdS/CFT) correspondence, where a higher-dimensional bulk geometry is associated with the code's logical degrees of freedom. Previous discrete holographic codes based on tensor networks have reproduced the general code properties expected from continuum AdS/CFT, such as complementary recovery. However, the boundary states of such tensor networks typically do not exhibit the expected correlation functions of CFT boundary states. In this work, we show that a new class of exact holographic codes, extending the previously proposed hyperinvariant tensor networks into quantum codes, produce the correct boundary correlation functions. This approach yields a dictionary between logical states in the bulk and the critical renormalization group flow of boundary states. Furthermore, these codes exhibit a state-dependent breakdown of complementary recovery as expected from AdS/CFT under small quantum gravity corrections.

Nature Communications•Nov 11, 2023•20 citations

Holographic Codes from Hyperinvariant Tensor Networks

Matthew Steinberg, Sebastian Feld, A. Jahn

Holographic quantum-error correcting codes are models of bulk/boundary dualities such as the anti-de Sitter/conformal field theory (AdS/CFT) correspondence, where a higher-dimensional bulk geometry is associated with the code's logical degrees of freedom. Previous discrete holographic codes based on tensor networks have reproduced the general code properties expected from continuum AdS/CFT, such as complementary recovery. However, the boundary states of such tensor networks typically do not exhibit the expected correlation functions of CFT boundary states. In this work, we show that a new class of exact holographic codes, extending the previously proposed hyperinvariant tensor networks into quantum codes, produce the correct boundary correlation functions. This approach yields a dictionary between logical states in the bulk and the critical renormalization group flow of boundary states. Furthermore, these codes exhibit a state-dependent breakdown of complementary recovery as expected from AdS/CFT under small quantum gravity corrections.

arXiv:2304.02732•Jan 1, 2023•0 citations

Laboratory Realization of an Analogue AdS - CFT Duality in a Cold-Atom Hyperbolic Lattice

Parker Emmerson

We present a comprehensive experimental proposal to realize a toy model ofthe AdS/CFT correspondence in a cold‑atom quantum simulator. Atwo‑dimensional hyperbolic optical lattice, generated by a combination ofstructured laser beams, hosts ultracold bosonic atoms whose hoppingamplitudes are engineered to reproduce the metric of anti‑de Sitter space(AdS$_{2+1}$). The boundary of the lattice is a one‑dimensional ring ofatoms that plays the role of the conformal field theory (CFT). Byexploiting synthetic gauge fields and Raman‑assisted tunneling, theeffective speed of light in the bulk becomes locally tunable, enablingthe simulation of the Malament–Hogarth effect---an infinite proper timewithin a finite boundary time. We detail the construction of thehyperbolic lattice, the mapping of bulk fields to boundary operators, theencoding of a universal Turing machine as a bulk defect, and the readoutof the computational halt state via boundary correlation measurementswith exponential suppression of errors. Our blueprint provides themissing laboratory platform for the PV‑crystallographic hypercomputerand opens a new paradigm for table‑top holographic quantum computation.

•Jun 26, 2026•0 citations
The PV‑crystallographic hypercomputer architecture of Emmerson~\cite{EmmersonPVHPC}requires two capabilities that were left as open assumptions: (i) embedding auniversal Turing machine (UTM) into a bulk probe inside an AdS (oreffective‑cone) temporal‑compression chamber, and (ii) reading out the haltstate on the boundary with fidelity arbitrarily close to unity at the finiteexternal deadline. This paper supplies a complete, rigorous mathematicalsolution to both. We work within the holographic quantum error‑correcting code formalism,exemplified by the HaPPY perfect‑tensor network. The bulk is a negativelycurved tensor network whose boundary is a one‑dimensional spin chain. A\emph{bulk Turing probe} is defined as a designated set of bulk logicalindices that realize a universal Turing machine, with an infinite tapeextending along the radial direction and a finite‑state head. Theholographic map encodes the entire tape and head state into the boundarywith built‑in quantum error correction. A special \emph{halt tensor}inside the network encodes the answer: if the simulated program halts, alocal operation toggles the halt tensor from (|0\rangle) to (|1\rangle);otherwise it stays at (|0\rangle). On the boundary, the halt state becomes a logical qubit protected by aholographic code of distance (D). We define the \emph{crystallizationlatch} as a boundary operator (\LL) that measures this logical qubit. Bychoosing the network size appropriately, the effective error per measurementis exponentially small in (D). Consequently, for any desired targetfidelity (1-\varepsilon), there exists a finite tensor network and afinite readout region such that the boundary latch yields the correct haltpredicate with probability at least (1-\varepsilon). The proper time ofthe probe diverges as its location approaches the conformal boundary,implementing the infinite proper‑time condition exactly. The construction isfully explicit and does not rely on any new physics beyond the standardholographic duality. Thus we complete the missing link in the PV‑crystallographic hypercomputer,establishing that a bulk universal Turing machine with high‑fidelityboundary readout is mathematically consistent and can be engineered withinthe known framework of AdS/CFT.
The PV‑crystallographic hypercomputer architecture of Emmerson~\cite{EmmersonPVHPC}requires two capabilities that were left as open assumptions: (i) embedding auniversal Turing machine (UTM) into a bulk probe inside an AdS (oreffective‑cone) temporal‑compression chamber, and (ii) reading out the haltstate on the boundary with fidelity arbitrarily close to unity at the finiteexternal deadline. This paper supplies a complete, rigorous mathematicalsolution to both. We work within the holographic quantum error‑correcting code formalism,exemplified by the HaPPY perfect‑tensor network. The bulk is a negativelycurved tensor network whose boundary is a one‑dimensional spin chain. A\emph{bulk Turing probe} is defined as a designated set of bulk logicalindices that realize a universal Turing machine, with an infinite tapeextending along the radial direction and a finite‑state head. Theholographic map encodes the entire tape and head state into the boundarywith built‑in quantum error correction. A special \emph{halt tensor}inside the network encodes the answer: if the simulated program halts, alocal operation toggles the halt tensor from ∣0⟩|0\rangle∣0⟩ to ∣1⟩|1\rangle∣1⟩;otherwise it stays at ∣0⟩|0\rangle∣0⟩. On the boundary, the halt state becomes a logical qubit protected by aholographic code of distance DDD. We define the \emph{crystallizationlatch} as a boundary operator \(\LL\) that measures this logical qubit. Bychoosing the network size appropriately, the effective error per measurementis exponentially small in DDD. Consequently, for any desired targetfidelity 1−ε1-\varepsilon1−ε, there exists a finite tensor network and afinite readout region such that the boundary latch yields the correct haltpredicate with probability at least 1−ε1-\varepsilon1−ε. The proper time ofthe probe diverges as its location approaches the conformal boundary,implementing the infinite proper‑time condition exactly. The construction isfully explicit and does not rely on any new physics beyond the standardholographic duality. Thus we complete the missing link in the PV‑crystallographic hypercomputer,establishing that a bulk universal Turing machine with high‑fidelityboundary readout is mathematically consistent and can be engineered withinthe known framework of AdS/CFT.
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.
Holographic quantum-error correcting codes are models of bulk/boundary dualities such as the anti-de Sitter/conformal field theory (AdS/CFT) correspondence, where a higher-dimensional bulk geometry is associated with the code's logical degrees of freedom. Previous discrete holographic codes based on tensor networks have reproduced the general code properties expected from continuum AdS/CFT, such as complementary recovery. However, the boundary states of such tensor networks typically do not exhibit the expected correlation functions of CFT boundary states. In this work, we show that a new class of exact holographic codes, extending the previously proposed hyperinvariant tensor networks into quantum codes, produce the correct boundary correlation functions. This approach yields a dictionary between logical states in the bulk and the critical renormalization group flow of boundary states. Furthermore, these codes exhibit a state-dependent breakdown of complementary recovery as expected from AdS/CFT under small quantum gravity corrections.
Holographic quantum-error correcting codes are models of bulk/boundary dualities such as the anti-de Sitter/conformal field theory (AdS/CFT) correspondence, where a higher-dimensional bulk geometry is associated with the code's logical degrees of freedom. Previous discrete holographic codes based on tensor networks have reproduced the general code properties expected from continuum AdS/CFT, such as complementary recovery. However, the boundary states of such tensor networks typically do not exhibit the expected correlation functions of CFT boundary states. In this work, we show that a new class of exact holographic codes, extending the previously proposed hyperinvariant tensor networks into quantum codes, produce the correct boundary correlation functions. This approach yields a dictionary between logical states in the bulk and the critical renormalization group flow of boundary states. Furthermore, these codes exhibit a state-dependent breakdown of complementary recovery as expected from AdS/CFT under small quantum gravity corrections.
We present a comprehensive experimental proposal to realize a toy model ofthe AdS/CFT correspondence in a cold‑atom quantum simulator. Atwo‑dimensional hyperbolic optical lattice, generated by a combination ofstructured laser beams, hosts ultracold bosonic atoms whose hoppingamplitudes are engineered to reproduce the metric of anti‑de Sitter space(AdS2+1_{2+1}2+1​). The boundary of the lattice is a one‑dimensional ring ofatoms that plays the role of the conformal field theory (CFT). Byexploiting synthetic gauge fields and Raman‑assisted tunneling, theeffective speed of light in the bulk becomes locally tunable, enablingthe simulation of the Malament–Hogarth effect---an infinite proper timewithin a finite boundary time. We detail the construction of thehyperbolic lattice, the mapping of bulk fields to boundary operators, theencoding of a universal Turing machine as a bulk defect, and the readoutof the computational halt state via boundary correlation measurementswith exponential suppression of errors. Our blueprint provides themissing laboratory platform for the PV‑crystallographic hypercomputerand opens a new paradigm for table‑top holographic quantum computation.