HackerPapers

arXiv:2404.15403quant-ph

Proof of a Universal Speed Limit on Fast Scrambling in Quantum Systems

Amit Vikram, Laura Shou, Victor Galitski

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

We prove that the time required for sustained information scrambling in any Hamiltonian quantum system is universally at least logarithmic in the entanglement entropy of scrambled states. This addresses two foundational problems in nonequilibrium quantum dynamics. (1) It sets the earliest possible time for the applicability of equilibrium statistical mechanics in a quantum system coupled to a bath at a finite temperature. (2) It proves a version of the fast scrambling conjecture, originally motivated in models associated with black holes, as a fundamental property of quantum mechanics itself. Our result builds on a refinement of the energy-time uncertainty principle in terms of the infinite temperature spectral form factor in quantum chaos. We generalize this formulation to arbitrary initial states of the bath, including finite temperature states, by mapping Hamiltonian dynamics with any initial state to nonunitary dynamics at infinite temperature. A regularized spectral form factor emerges naturally from this procedure, whose decay is universally constrained by analyticity in complex time. This establishes an exact speed limit on information scrambling by the most general quantum mechanical Hamiltonian, without any restrictions on locality or the nature of interactions.

arXiv comments
7+12 pages, 2+2 figures; v2: added an illustration of the bound for a random Hamiltonian, with additional figures and an expanded main text. Close to published version
Journal reference
Phys. Rev. Lett. 136, 150401 (2026)
DOI
doi:10.1103/y9z4-v641
Subjects
quant-phQuantum Physics cond-mat.stat-mechStatistical Mechanics hep-thHigh Energy Physics, Theory math-phMathematical Physics nlin.CDChaotic Dynamics

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Apr 2024 to Apr 2024. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.