MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Entanglement, quantum randomness, and complexity beyond scrambling

Author(s)
Liu, Zi-Wen; Lloyd, Seth; Zhu, Elton; Zhu, Huangjun
Thumbnail
Download13130_2018_Article_8575.pdf (883.3Kb)
PUBLISHER_CC

Publisher with Creative Commons License

Creative Commons Attribution

Terms of use
Creative Commons Attribution http://creativecommons.org/licenses/by/4.0/
Metadata
Show full item record
Abstract
Scrambling 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 Processes
Date issued
2018-07
URI
http://hdl.handle.net/1721.1/116884
Department
Massachusetts Institute of Technology. Center for Theoretical Physics; Massachusetts Institute of Technology. Department of Mechanical Engineering; Massachusetts Institute of Technology. Department of Physics
Journal
Journal of High Energy Physics
Publisher
Springer Berlin Heidelberg
Citation
Liu, Zi-Wen, et al. “Entanglement, Quantum Randomness, and Complexity beyond Scrambling.” Journal of High Energy Physics, vol. 2018, no. 7, July 2018.
Version: Final published version
ISSN
1029-8479

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.