Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1111.6580 · Journal of High Energy Physics

Towards the fast scrambling conjecture

Nima Lashkari, Douglas Stanford, Matthew B. Hastings, Tobias J. Osborne, Patrick M. Hayden

Published Apr 1, 2013• 476 citations
arXivHTMLPDF
DOI
10.1007/jhep04(2013)022

Related papers

Deterministic fast scrambling with Rydberg arrays

Gregory S. Bentsen, Tomohiro Hashizume, Sebastian Weber +1 more

Bulletin of the American Physical Society•Jun 3, 2021•0 citations

Numerics of Fast Scrambling in the SYK Model

Bryce Kobrin, Christopher T. Olund, Douglas Stanford +2 more

Bulletin of the American Physical Society•Mar 8, 2018•1 citation

Fast scrambling in the Sachdev-Ye-Kitaev model: a numerical test

Christopher T. Olund, Norman Y. Yao, Joel E. Moore

Bulletin of the American Physical Society•Jun 6, 2017•0 citations

Fast scrambling on sparse graphs

Gregory S. Bentsen, Yingfei Gu, Andrew Lucas

Given a quantum many-body system with few-body interactions, how rapidly can quantum information be hidden during time evolution? The fast-scrambling conjecture is that the time to thoroughly mix information among N degrees of freedom grows at least logarithmically in N. We derive this inequality for generic quantum systems at infinite temperature, bounding the scrambling time by a finite decay time of local quantum correlations at late times. Using Lieb-Robinson bounds, generalized Sachdev-Ye-Kitaev models, and random unitary circuits, we propose that a logarithmic scrambling time can be achieved in most quantum systems with sparse connectivity. These models also elucidate how quantum chaos is not universally related to scrambling: We construct random few-body circuits with infinite Lyapunov exponent but logarithmic scrambling time. We discuss analogies between quantum models on graphs and quantum black holes and suggest methods to experimentally study scrambling with as many as 100 sparsely connected quantum degrees of freedom.

arXiv:1805.08215•Proceedings of the National Academy of Sciences•Mar 21, 2019•77 citations

Scrambling in Yang-Mills

Robert de Mello Koch, Eunice Gandote, Augustine Larweh Mahu

Abstract Acting on operators with a bare dimension ∆ ∼ N2 the dilatation operator of U(N) $$ \mathcal{N} $$ N = 4 super Yang-Mills theory defines a 2-local Hamiltonian acting on a graph. Degrees of freedom are associated with the vertices of the graph while edges correspond to terms in the Hamiltonian. The graph has p ∼ N vertices. Using this Hamiltonian, we study scrambling and equilibration in the large N Yang-Mills theory. We characterize the typical graph and thus the typical Hamiltonian. For the typical graph, the dynamics leads to scrambling in a time consistent with the fast scrambling conjecture. Further, the system exhibits a notion of equilibration with a relaxation time, at weak coupling, given by t ∼ $$ \frac{\rho }{\lambda } $$ ρ λ with λ the ’t Hooft coupling.

arXiv:2008.12409•Journal of High Energy Physics•Jan 12, 2021•11 citations

An Efficient Parallel Repetition Theorem

Johan Håstad, Rafael Pass, Douglas Wikström +1 more

Lecture notes in computer science•Jan 1, 2010•46 citations
Given a quantum many-body system with few-body interactions, how rapidly can quantum information be hidden during time evolution? The fast-scrambling conjecture is that the time to thoroughly mix information among N degrees of freedom grows at least logarithmically in N. We derive this inequality for generic quantum systems at infinite temperature, bounding the scrambling time by a finite decay time of local quantum correlations at late times. Using Lieb-Robinson bounds, generalized Sachdev-Ye-Kitaev models, and random unitary circuits, we propose that a logarithmic scrambling time can be achieved in most quantum systems with sparse connectivity. These models also elucidate how quantum chaos is not universally related to scrambling: We construct random few-body circuits with infinite Lyapunov exponent but logarithmic scrambling time. We discuss analogies between quantum models on graphs and quantum black holes and suggest methods to experimentally study scrambling with as many as 100 sparsely connected quantum degrees of freedom.
Abstract Acting on operators with a bare dimension ∆ ∼ N2 the dilatation operator of U(N) N \mathcal{N} N N = 4 super Yang-Mills theory defines a 2-local Hamiltonian acting on a graph. Degrees of freedom are associated with the vertices of the graph while edges correspond to terms in the Hamiltonian. The graph has p ∼ N vertices. Using this Hamiltonian, we study scrambling and equilibration in the large N Yang-Mills theory. We characterize the typical graph and thus the typical Hamiltonian. For the typical graph, the dynamics leads to scrambling in a time consistent with the fast scrambling conjecture. Further, the system exhibits a notion of equilibration with a relaxation time, at weak coupling, given by t ∼ ρλ \frac{\rho }{\lambda } λρ​ ρ λ with λ the ’t Hooft coupling.