Show simple item record

dc.contributor.authorLiu, Zi-Wen
dc.contributor.authorLloyd, Seth
dc.contributor.authorZhu, Elton
dc.contributor.authorZhu, Huangjun
dc.date.accessioned2018-07-11T14:16:28Z
dc.date.available2018-07-11T14:16:28Z
dc.date.issued2018-07
dc.date.submitted2018-04
dc.identifier.issn1029-8479
dc.identifier.urihttp://hdl.handle.net/1721.1/116884
dc.description.abstractScrambling is a process by which the state of a quantum system is effectively randomized due to the global entanglement that “hides” initially localized quantum information. Closely related notions include quantum chaos and thermalization. Such phenomena play key roles in the study of quantum gravity, many-body physics, quantum statistical mechanics, quantum information etc. Scrambling can exhibit different complexities depending on the degree of randomness it produces. For example, notice that the complete randomization implies scrambling, but the converse does not hold; in fact, there is a significant complexity gap between them. In this work, we lay the mathematical foundations of studying randomness complexities beyond scrambling by entanglement properties. We do so by analyzing the generalized (in particular Rényi) entanglement entropies of designs, i.e. ensembles of unitary channels or pure states that mimic the uniformly random distribution (given by the Haar measure) up to certain moments. A main collective conclusion is that the Rényi entanglement entropies averaged over designs of the same order are almost maximal. This links the orders of entropy and design, and therefore suggests Rényi entanglement entropies as diagnostics of the randomness complexity of corresponding designs. Such complexities form a hierarchy between information scrambling and Haar randomness. As a strong separation result, we prove the existence of (state) 2-designs such that the Rényi entanglement entropies of higher orders can be bounded away from the maximum. However, we also show that the min entanglement entropy is maximized by designs of order only logarithmic in the dimension of the system. In other words, logarithmic-designs already achieve the complexity of Haar in terms of entanglement, which we also call max-scrambling. This result leads to a generalization of the fast scrambling conjecture, that max-scrambling can be achieved by physical dynamics in time roughly linear in the number of degrees of freedom. This paper is an extended version of Phys. Rev. Lett. 120 (2018) 130502 [1]. Keywords: Random Systems, Black Holes in String Theory, Holography and condensed matter physics (AdS/CMT), Stochastic Processesen_US
dc.description.sponsorshipUnited States. Air Force. Office of Scientific Researchen_US
dc.description.sponsorshipUnited States. Army Research Officeen_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Contract CCF-1525130)en_US
dc.publisherSpringer Berlin Heidelbergen_US
dc.relation.isversionofhttps://doi.org/10.1007/JHEP07(2018)041en_US
dc.rightsCreative Commons Attributionen_US
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/en_US
dc.sourceSpringer Berlin Heidelbergen_US
dc.titleEntanglement, quantum randomness, and complexity beyond scramblingen_US
dc.typeArticleen_US
dc.identifier.citationLiu, Zi-Wen, et al. “Entanglement, Quantum Randomness, and Complexity beyond Scrambling.” Journal of High Energy Physics, vol. 2018, no. 7, July 2018.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Center for Theoretical Physicsen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mechanical Engineeringen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Physicsen_US
dc.contributor.mitauthorLiu, Zi-Wen
dc.contributor.mitauthorLloyd, Seth
dc.contributor.mitauthorZhu, Elton
dc.relation.journalJournal of High Energy Physicsen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dc.date.updated2018-07-08T03:47:14Z
dc.language.rfc3066en
dc.rights.holderThe Author(s)
dspace.orderedauthorsLiu, Zi-Wen; Lloyd, Seth; Zhu, Elton; Zhu, Huangjunen_US
dspace.embargo.termsNen_US
dc.identifier.orcidhttps://orcid.org/0000-0002-4497-2093
mit.licensePUBLISHER_CCen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record