Search

Abstract Using the tensor Radon transform and related numerical methods, we study how bulk geometries can be explicitly reconstructed from boundary entanglement entropies in the specific case of AdS3 /CFT2. We find that, given the boundary entanglement entropies of a 2d CFT, this framework provides a quantitative measure that detects whether the bulk dual is geometric in the perturbative (near AdS) limit. In the case where a well-defined bulk geometry exists, we explicitly reconstruct the unique bulk metric tensor once a gauge choice is made. We then examine the emergent bulk geometries for static and dynamical scenarios in holography and in many-body systems. Apart from the physics results, our work demonstrates that numerical methods are feasible and effective in the study of bulk reconstruction in AdS/CFT.

Abstract We reconsider the black hole firewall puzzle, emphasizing that quantum error- correction, computational complexity, and pseudorandomness are crucial concepts for understanding the black hole interior. We assume that the Hawking radiation emitted by an old black hole is pseudorandom, meaning that it cannot be distinguished from a perfectly thermal state by any efficient quantum computation acting on the radiation alone. We then infer the existence of a subspace of the radiation system which we interpret as an encoding of the black hole interior. This encoded interior is entangled with the late outgoing Hawking quanta emitted by the old black hole, and is inaccessible to computationally bounded observers who are outside the black hole. Specifically, efficient operations acting on the radiation, those with quantum computational complexity polynomial in the entropy of the remaining black hole, commute with a complete set of logical operators acting on the encoded interior, up to corrections which are exponentially small in the entropy. Thus, under our pseudorandomness assumption, the black hole interior is well protected from exterior observers as long as the remaining black hole is macroscopic. On the other hand, if the radiation is not pseudorandom, an exterior observer may be able to create a firewall by applying a polynomial-time quantum computation to the radiation.

Abstract Motivated by the close relationship between quantum error-correction, topological order, the holographic AdS/CFT duality, and tensor networks, we initiate the study of approximate quantum error-detecting codes in matrix product states (MPS). We first show that using open-boundary MPS to define boundary to bulk encoding maps yields at most constant distance error-detecting codes. These are degenerate ground spaces of gapped local Hamiltonians. To get around this no-go result, we consider excited states, i.e., we use the excitation ansatz to construct encoding maps: these yield error-detecting codes with distance Ω(n 1−ν ) for any ν ∈ (0, 1) and Ω(log n) encoded qubits. This shows that gapped systems contain — within isolated energy bands — error-detecting codes spanned by momentum eigenstates. We also consider the gapless Heisenberg-XXX model, whose energy eigenstates can be described via Bethe ansatz tensor networks. We show that it contains — within its low-energy eigenspace — an error-detecting code with the same parameter scaling. All these codes detect arbitrary d-local (not necessarily geometrically local) errors even though they are not permutation-invariant. This suggests that a wide range of naturally occurring many-body systems possess intrinsic error-detecting features.