Fast Scram blers

By Y. Sekino, L. Susskind. 2008

1,108 citations recorded by the source corpus.

We consider the problem of how fast a quantum system can scramble (thermalize) information, given that the interactions are between bounded clusters of degrees of freedom; pairwise interactions would be an example. Based on previous work, we conjecture: 1) The most rapid scramblers take a time logarithmic in the number of degrees of freedom. 2) Matrix quantum mechanics (systems whose degrees of freedom are n by n matrices) saturate the bound. 3) Black holes are the fastest scramblers in nature. The conjectures are based on two sources, one from quantum information theory, and the other from the study of black holes in String Theory.

Subfields: Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Nuclear and High Energy Physics

View Paper: https://www.semanticscholar.org/paper/e30c3316595b7f1f8f3175e3e6204e148705d07e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

In Computer Vision and Pattern Recognition

In Nuclear and High Energy Physics

Citations in the corpus

Multiple shocks (2013, neutral): “32 96 v2 [ he p- Contents”
Noether charge, black hole volume, and complexity (2016, background): “That the bound is saturated is another conjecture but is appealing: black holes seem to excel at information-related tasks since they saturate the Bekenstein bound [44, 45] and are believed to be the fastest scramblers in nature [46].”
Black holes and the butterfly effect (2013, background): “The original gravitational interpretation of scrambling as charge spreading on the horizon [12] is very much in the spirit of our calculation.”
Trans-Planckian Censorship and the Swampland (2019, methodology): “There is an interesting similarity between the upper bound on the dS lifetime predicted by TCC and the scrambling time associated to dS space where we use the scrambling time given by [18] τscrambling ∝ lnS T ,”
Bounding the space of holographic CFTs with chaos (2016, background): “This is the (updated version of the) fast scrambling conjecture [20].”
Translationally Invariant Non-Fermi-Liquid Metals with Critical Fermi Surfaces: Solvable Models (2018, background): “It has been proposed in recent years that the spread of information (or information scrambling [132]) can be diagnosed by studying special correlation functions which involve squared (anti)commutators of local operators [47,125,133].”
A bound on chaos (2015, methodology): “It is a refinement of the fast scrambling conjecture of [3] which again singles out black holes.”
Islands in Schwarzschild black holes (2020, neutral): “[43].”
Holographic complexity in Vaidya spacetimes. Part II (2018, methodology): “Following [49], we can relate the first correction to the scrambling time [55].”
Localized shocks (2014, background): “The connection to scrambling was made in [37], and the connection to gauge/gravity duality was made in [38].”
Scrambling Dynamics and Out-of-Time-Ordered Correlators in Quantum Many-Body Systems (2022, background): “The Hamiltonian can be written as H = ∑ Jαβrr′ (t)σ α r σ β r′ (90) The strongest connectivity occurs when the graph is a complete graph where each qubit connects to every qubit with approximately the same interaction strength J (exactly the same coupling between all pairs makes the model integrable”
Islands in asymptotically flat 2D gravity (2020, result): “This agrees with [51,52], including the lnN correction also found in [2].”
Chaos in quantum channels (2015, methodology): “” A much weaker notion of scrambling of a state (which [2] calls “Page scrambling,” or usually just “scrambling”) is given by a state that has the property that any arbitrary subsystem of up to half the state’s degrees of freedom are nearly maximally mixed.”