Towards the fast scrambling conjecture

被引:307
作者
Lashkari, Nima [1 ]
Stanford, Douglas [2 ]
Hastings, Matthew [3 ,4 ]
Osborne, Tobias [5 ]
Hayden, Patrick [1 ,6 ,7 ]
机构
[1] McGill Univ, Dept Phys, Montreal, PQ, Canada
[2] Stanford Univ, Dept Phys, Stanford Inst Theoret Phys, Stanford, CA 94305 USA
[3] Duke Univ, Dept Phys, Durham, NC 27706 USA
[4] Microsoft Stn Q, Santa Barbara, CA USA
[5] Leibniz Univ Hannover, Inst Theoret Phys, Hannover, Germany
[6] McGill Univ, Sch Comp Sci, Montreal, PQ, Canada
[7] Perimeter Inst Theoret Phys, Waterloo, ON, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Lattice Integrable Models; M(atrix) Theories; Black Holes; Quantum Dissipative Systems; LIEB-ROBINSON BOUNDS; BLACK-HOLES; QUANTUM; ENTROPY;
D O I
10.1007/JHEP04(2013)022
中图分类号
O412 [相对论、场论]; O572.2 [粒子物理学];
学科分类号
摘要
Many proposed quantum mechanical models of black holes include highly non-local interactions. The time required for thermalization to occur in such models should reflect the relaxation times associated with classical black holes in general relativity. Moreover, the time required for a particularly strong form of thermalization to occur, sometimes known as scrambling, determines the time scale on which black holes should start to release information. It has been conjectured that black holes scramble in a time logarithmic in their entropy, and that no system in nature can scramble faster. In this article, we address the conjecture from two directions. First, we exhibit two examples of systems that do indeed scramble in logarithmic time: Brownian quantum circuits and the antiferromagnetic Ising model on a sparse random graph. Unfortunately, both fail to be truly ideal fast scramblers for reasons we discuss. Second, we use Lieb-Robinson techniques to prove a logarithmic lower bound on the scrambling time of systems with finite norm terms in their Hamiltonian. The bound holds in spite of any nonlocal structure in the Hamiltonian, which might permit every degree of freedom to interact directly with every other one.
引用
收藏
页数:33
相关论文
共 57 条
[11]  
Chuang I. N., 2000, Quantum Computation and Quantum Information
[12]   Exact and approximate unitary 2-designs and their application to fidelity estimation [J].
Dankert, Christoph ;
Cleve, Richard ;
Emerson, Joseph ;
Livine, Etera .
PHYSICAL REVIEW A, 2009, 80 (01)
[13]   Excitations of D-strings, entropy and duality [J].
Das, SR ;
Mathur, SD .
PHYSICS LETTERS B, 1996, 375 (1-4) :103-110
[14]  
Deutsch J. M., 1991, PHYS REV A, V43
[15]   Comment on "Random Quantum Circuits are Approximate 2-designs" by A.W. Harrow and R.A. Low (Commun. Math. Phys. 291, 257-302 (2009)) [J].
Diniz, Igor Tuche ;
Jonathan, Daniel .
COMMUNICATIONS IN MATHEMATICAL PHYSICS, 2011, 304 (01) :281-293
[16]   Convergence conditions for random quantum circuits [J].
Emerson, J ;
Livine, E ;
Lloyd, S .
PHYSICAL REVIEW A, 2005, 72 (06)
[17]   CONTINUITY PROPERTY OF ENTROPY DENSITY FOR SPIN-LATTICE SYSTEMS [J].
FANNES, M .
COMMUNICATIONS IN MATHEMATICAL PHYSICS, 1973, 31 (04) :291-294
[18]  
Gemmer J, 2009, LECT NOTES PHYS, V784, P1
[19]   Canonical typicality [J].
Goldstein, S ;
Lebowitz, JL ;
Tumulka, R ;
Zanghì, N .
PHYSICAL REVIEW LETTERS, 2006, 96 (05)
[20]   Random Quantum Circuits are Approximate 2-designs [J].
Harrow, Aram W. ;
Low, Richard A. .
COMMUNICATIONS IN MATHEMATICAL PHYSICS, 2009, 291 (01) :257-302