Length-resolved Operator Growth and Path-Entropy Obstructions to Many-Body Localization

This paper proves that operator growth in the disordered Ising chain with strictly positive couplings and fields exhibits almost factorial scaling in both time and spatial support, thereby rigorously ruling out dynamical localization at any disorder strength and revealing a structural path-entropy obstruction to perturbative many-body localization.

Original authors: J. Sirker

Published 2026-06-09
📖 5 min read🧠 Deep dive

Original authors: J. Sirker

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you have a long line of people (a "spin chain") holding hands. Some are holding hands tightly (strong connections), and others are holding hands loosely or not at all (disorder). In physics, we often ask: If you push the person at the very start of the line, does that "push" stay localized near them, or does it spread out to shake everyone else?

In the world of quantum physics, this question is about Many-Body Localization (MBL). For a long time, physicists hoped that if the disorder (the "looseness" of the connections) was strong enough, the push would get stuck, and the system would never forget its initial state. This would be like a traffic jam that never clears.

However, this paper argues that for certain types of quantum systems, that traffic jam is an illusion. Here is the breakdown of their findings using simple analogies:

1. The "Explosion" of Possibilities

The authors study what happens when you repeatedly "poke" the system (mathematically, taking commutators). They found that the "push" doesn't just spread; it explodes in complexity.

Imagine you are trying to walk from your house to a friend's house.

  • The Old View (Localization): You take one path, maybe a few detours, but you stay on a specific street.
  • The New View (This Paper): Every time you take a step, the number of possible paths you could have taken multiplies wildly. It's not just a few detours; it's as if every step you take splits into a branching tree of possibilities that grows almost factorially (a number that grows faster than you can count, like 100!100!).

The paper proves that in these disordered systems, the "weight" of the push isn't just spreading out; it is being distributed across a massive, almost infinite number of different paths simultaneously.

2. The "Path Entropy" Obstacle

The authors introduce a concept called Path Entropy. Think of this as the sheer "noise" or "confusion" caused by having too many options.

  • The Analogy: Imagine trying to hear a whisper in a room. If the room is quiet (low entropy), you can hear it. But if the room is filled with millions of people all shouting different random things (high path entropy), the whisper gets drowned out.
  • The Result: In these quantum systems, the "noise" of the billions of possible paths is so loud that it overpowers any attempt to keep the information localized. The paper argues that for the system to remain localized, all these billions of random paths would have to magically cancel each other out perfectly (like a choir singing so perfectly that the sound disappears). The authors say this is statistically impossible without some special, hidden rule that we haven't found yet.

3. The "Finite-Size" Illusion

One of the most practical findings is about why computer simulations have been confusing.

  • The Analogy: Imagine you are studying how fast a forest fire spreads. If you only look at a tiny patch of grass (a small computer simulation), the fire might seem to die out quickly because it runs out of grass to burn. It looks like the fire is "localized."
  • The Reality: But if you look at the whole forest, the fire spreads everywhere.
  • The Paper's Claim: The authors prove that current computer simulations are looking at "tiny patches." They derived a specific scale: L(W/J)2L \sim (W/J)^2. As long as the system size (LL) is smaller than this scale, the system looks like it's localized. But once the system gets big enough (larger than this scale), the "fire" (the operator growth) inevitably spreads out. The "localization" seen in small simulations is just a pre-asymptotic regime—a temporary illusion before the true, spreading behavior takes over.

4. The Failure of the "Fix-It" Tool

Physicists have a mathematical tool (called a Schrieffer-Wolff transformation) used to "fix" a messy system and turn it into a neat, localized one. They hoped this tool would work for these disordered chains.

  • The Analogy: Imagine trying to organize a messy room by moving items one by one.
  • The Problem: The authors show that as you try to organize the room, the "mess" (the number of possible ways to arrange things) grows so fast that your organizing tool breaks down. The "path entropy" (the sheer number of ways the mess can happen) overwhelms the tool's ability to keep things tidy.
  • The Conclusion: You cannot mathematically construct a "localized" version of this system using standard methods because the complexity of the paths is too high.

The Bottom Line

The paper concludes that true, permanent localization (where the system never forgets its start) is likely impossible in these specific quantum chains, no matter how strong the disorder is.

  • Short term/Small systems: It looks like the system is stuck (localized).
  • Long term/Large systems: The "path entropy" wins. The system eventually spreads out, forgets its initial state, and becomes "ergodic" (fully mixed).

The authors suggest that if localization does exist, it would require a miraculous, hidden mechanism where billions of random paths cancel each other out perfectly—a scenario they consider highly unlikely. Therefore, in the real, infinite world, these systems are likely always chaotic and spreading, not stuck.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →