Understanding holographic error correction via unique algebras and atomic examples
arXiv:2110.14691 · doi:10.1007/JHEP06(2022)056
Abstract
We introduce a fully constructive characterisation of holographic quantum error-correcting codes. That is, given a code and an erasure error we give a recipe to explicitly compute the terms in the RT formula. Using this formalism, we employ quantum circuits to construct a number of examples of holographic codes. Our codes have nontrivial holographic properties and are simpler than existing approaches built on tensor networks. Finally, leveraging a connection between correctable and private systems we prove the uniqueness of the algebra satisfying complementary recovery. The material is presented with the goal of accessibility to researchers in quantum information with no prior background in holography.
v2: published version, typos fixed, 66 pages, 4 figures
References in corpus (8)
- Holographic representation of local bulk operators
- Causality & holographic entanglement entropy
- Structure of states which satisfy strong subadditivity of quantum entropy with equality
- Linear growth of quantum circuit complexity
- Holographic tensor network models and quantum error correction: A topical review
- Quantum minimal surfaces from quantum error correction
- Quantum Error Correction of Observables
- Complementarity of Private and Correctable Subsystems in Quantum Cryptography and Error Correction