



02234nas a2200133   4500008004100000245004700041210004600088260001400134490000900148520187200157100001702029700001702046856003702063       2021                        eng d00aApproximate Bacon-Shor Code and Holography0 aApproximate BaconShor Code and Holography  c5/14/20210 v20213 a<p>We construct an explicit and solvable toy model for the AdS/CFT correspondence in the form of an approximate quantum error correction code with a non-trivial center 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 &quot;skewing&quot; 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 &quot;back-react&quot; 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 in the form of 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 &quot;large N limit&quot; where they are built by concatenating a large N number of copies.</p>1 aCao, ChunJun1 aLackey, Brad  uhttps://arxiv.org/abs/2010.05960