PIRSA:20100026

Leading order correction to the QES prescription

APA

Penington, G. (2020). Leading order correction to the QES prescription . Perimeter Institute for Theoretical Physics. https://pirsa.org/20100026

MLA

Penington, Geoffrey. Leading order correction to the QES prescription . Perimeter Institute for Theoretical Physics, Oct. 06, 2020, https://pirsa.org/20100026

BibTex

          @misc{ scivideos_PIRSA:20100026,
            doi = {10.48660/20100026},
            url = {https://pirsa.org/20100026},
            author = {Penington, Geoffrey},
            keywords = {Quantum Fields and Strings},
            language = {en},
            title = {Leading order correction to the QES prescription },
            publisher = {Perimeter Institute for Theoretical Physics},
            year = {2020},
            month = {oct},
            note = {PIRSA:20100026 see, \url{https://scivideos.org/index.php/pirsa/20100026}}
          }
          

Geoffrey Penington Stanford University

Talk numberPIRSA:20100026
Source RepositoryPIRSA

Abstract

We show that a naïve application of the quantum extremal surface (QES) prescription can lead to paradoxical results and must be corrected at leading order. The corrections arise when there is a second QES (with strictly larger generalized entropy at leading order than the minimal QES), together with a large amount of highly incompressible bulk entropy between the two surfaces. We trace the source of the corrections to a failure of the assumptions used in the replica trick derivation of the QES prescription, and show that a more careful derivation correctly computes the corrections. Using tools from one-shot quantum Shannon theory (smooth min- and max-entropies), we generalize these results to a set of refined conditions that determine whether the QES prescription holds. We find similar refinements to the conditions needed for entanglement wedge reconstruction (EWR), and show how EWR can be reinterpreted as the task of one-shot quantum state merging (using zero-bits rather than classical bits), a task gravity is able to achieve optimally efficiently.