Abstract There are two parts to this work: first, we study the error correction properties of the real-space renormalization group (RG). The long-distance operators are the (approximately) correctable operators encoded in the physical algebra of short-distance operators. This is closely related to modeling the holographic map as a quantum error correction code. As opposed to holography, the real-space RG of a many-body quantum system does not have the complementary recovery property. We discuss the role of large N and a large gap in the spectrum of operators in the emergence of complementary recovery. Second, we study the operator algebra exact quantum error correction for any von Neumann algebra. We show that similar to the finite dimensional case, for any error map in between von Neumann algebras the Petz dual of the error map is a recovery map if the inclusion of the correctable subalgebra of operators has finite index.
Abstract There are two parts to this work: first, we study the error correction properties of the real-space renormalization group (RG). The long-distance operators are the (approximately) correctable operators encoded in the physical algebra of short-distance operators. This is closely related to modeling the holographic map as a quantum error correction code. As opposed to holography, the real-space RG of a many-body quantum system does not have the complementary recovery property. We discuss the role of large N and a large gap in the spectrum of operators in the emergence of complementary recovery. Second, we study the operator algebra exact quantum error correction for any von Neumann algebra. We show that similar to the finite dimensional case, for any error map in between von Neumann algebras the Petz dual of the error map is a recovery map if the inclusion of the correctable subalgebra of operators has finite index.
We show that the real-space renormalization group (RG), as a map from the observable algebra to the subalgebra of long-distance observables, is an error correction code, best described by a conditional expectation. It is comprised of a coarse-graining step followed by an isometric embedding. The coarse-graining is the error map and the long-distance observables are the correctable operators. We show that if there is a state that is preserved under renormalization the coarse-graining step is the Petz dual of the isometric embedding (the Petz map). We demonstrate that a set of states are preserved under this map if and only if their pairwise relative entropies do not change when we restrict to the long-distance observables. We study the operator algebra quantum error correction in the GNS Hilbert space which applies to any quantum system including the local algebra of quantum field theory. We show that the recovery map is an isometric embedding of the correctable subalgebra. Similar to the RG, the composition of the error map followed by the recovery map forms a conditional expectation (a projection in the GNS Hilbert space). In gauge/gravity dualities, the bulk relative entropy of holographic states is the same as their boundary relative entropies which implies that the holographic map is an error correction code, and hence a conditional expectation. It follows that the boundary to the bulk map is a Petz map.
At the heart of recent progress in AdS/CFT is the question of subregion duality, or entanglement wedge reconstruction: which part(s) of the boundary CFT are dual to a given subregion of the bulk? This question can be answered by appealing to the quantum error correcting properties of holography, and it was recently shown that robust bulk (entanglement wedge) reconstruction can be achieved using a universal recovery channel known as the twirled Petz map. In short, one can use the twirled Petz map to recover bulk data from a subset of the boundary. However, this map involves an averaging procedure over bulk and boundary modular time, and hence it can be somewhat intractable to evaluate in practice. We show that a much simpler channel, the Petz map, is sufficient for entanglement wedge reconstruction for any code space of fixed finite dimension – no twirling is required. Moreover, the error in the reconstruction will always be non-perturbatively small. From a quantum information perspective, we prove a general theorem extending the use of the Petz map as a general-purpose recovery channel to subsystem and operator algebra quantum error correction.
Abstract At the heart of recent progress in AdS/CFT is the question of subregion duality, or entanglement wedge reconstruction: which part(s) of the boundary CFT are dual to a given subregion of the bulk? This question can be answered by appealing to the quantum error correcting properties of holography, and it was recently shown that robust bulk (entanglement wedge) reconstruction can be achieved using a universal recovery channel known as the twirled Petz map. In short, one can use the twirled Petz map to recover bulk data from a subset of the boundary. However, this map involves an averaging procedure over bulk and boundary modular time, and hence it can be somewhat intractable to evaluate in practice. We show that a much simpler channel, the Petz map, is sufficient for entanglement wedge reconstruction for any code space of fixed finite dimension — no twirling is required. Moreover, the error in the reconstruction will always be non-perturbatively small. From a quantum information perspective, we prove a general theorem extending the use of the Petz map as a general-purpose recovery channel to subsystem and operator algebra quantum error correction.
We show that in renormalization group (RG) flow the low-energy states form a code subspace that is approximately protected against the local short-distance errors. To demonstrate how general this connection is, we consider three examples: the classical Ising model in one dimension, free relativistic scalar quantum field theory (QFT) in two spacetime dimensions, and holographic field theories as examples of strongly coupled systems. As a concrete example of real-space RG in QFT, we consider the continuous multiscale renormalization ansatz for massive free fields and show that the low-energy coherent states are approximately protected from the quantum errors caused by the high-energy localized coherent operators. In holographic RG flows, we study the phase transition in the entanglement wedge of a single region and argue that one needs to define the price and the distance of the code with respect to the reconstructable wedge.
We develop a theory of approximate quantum error correction (QEC) based on the error-set model, complemented by general methods for code construction. Exact QEC has a powerful error-set structure: by the Knill-Laflamme conditions, a code correcting a given error set automatically protects against every channel whose Kraus operators lie in their linear span. This linearity gives rise to code distance, the equivalence between erasures and general errors, and a theory of asymptotically good codes. A longstanding view has been that these features do not extend to AQEC, leaving the theory essentially channel-by-channel. We show instead that, although full Knill--Laflamme linearity fails, a restricted form survives and suffices to extend all three structural features to the approximate setting. Specifically, a common error-set criterion governs families of channels whose Kraus operators are linear combinations of a given error set and whose coefficient matrices satisfy a spectral constraint. Using the Bény-Oreshkov worst-case and Petz average-case frameworks, we derive uniform fidelity guarantees for these families in terms of two new code parameters--the \emph{environment-leakage distance}, controlling worst-case performance, and the \emph{Knill-Laflamme Hellinger distance}, characterizing the average-case performance of Petz recovery.
To demonstrate the scope of this model, we develop partition-based constructions across diverse quantum systems and geometries, placing exact and approximate correction on equal footing. These constructions lead to a metric--error alignment hierarchy for Hilbert spaces, metrics, and error families, which in turn characterizes the resulting recovery guarantees. They yield the first known asymptotically good code families for fermionic systems, one-dimensional Rydberg-blockaded systems, and deletion errors, and extend to other physical platforms.
In this thesis, we study a couple of different but related questions: holography and quantum error correction, the gravitationally dressed operators and locality in holographic theory, introducing generalized versions of the class of continuous matrix product state as the most famous class of tensor network, and the notion of Krylov complexity of matrix quantum mechanics. In the first part, we use the notion of the Petz map and apply it to reconstruct operators in the entanglement wedge. Moreover, for geometries that contain black holes, we generalize the notion of the Petz map by itself and reconstruct black hole interior modes. In particular, we show that the Petz map reconstruction of the black hole interior is equivalent to the Papadodimas-Raju Proposal. In the second part, within the AdS/CFT correspondence, we identify a class of CFT operators which represent diff-invariant and approximately local observables in the gravitational dual. The interpretation of these observables is that they are not gravitationally dressed with respect to the boundary, but instead to features of the state. We also provide evidence that there are bulk observables whose commutator vanishes to all orders in 1/N with the entire algebra of single-trace operators defined in a space-like separated time-band. In the third part, we defined two new classes of continuous tensor networks by generalizing the class of continuous matrix product states. One is appropriate to describe the ground state of the relativistic field theory at strong coupling and the other is proper for the theories on compact spacetime. We conjecture that the possible bulk dual of it in the AdS/CFT can be an evaporating black hole microstates with the end of the word branes. In the last project, we study the Krylov complexity for 1-matrix quantum mechanics. In the ground state, the Lancsoz coefficients have linear behavior. The bn coefficients have a positive slope while an coefficients have a negative slope. In the thermal states, the an coefficients are zero while bn have two branches of linear growth. Although matrix quantum mechanics is a solvable theory rather than chaotic, we find the linear behavior of the Lancsoz coefficients of this theory.