Complexity of Quadratic Quantum Chaos

This paper introduces minimal two-body Hamiltonians with random interactions that exhibit "quadratic quantum chaos" in hard-core boson systems, demonstrating their spectral and dynamical properties—such as operator growth and convergence to Haar-randomness—closely parallel the Sachdev-Ye-Kitaev model while offering a resource-efficient platform for studying quantum chaos on near-term quantum devices.

The Gist

Imagine you have a giant, complex machine made of thousands of tiny switches (quantum bits, or "qubits"). You want to know if this machine is chaotic—meaning it scrambles information so thoroughly that you can never figure out where a specific piece of data started—or if it's orderly (integrable), where things just wiggle predictably.

For decades, physicists have studied a famous theoretical machine called the SYK model. It's the "gold standard" for chaos. But there's a problem: the real SYK model is built from "fermions" (a type of particle), which makes it incredibly hard to simulate on computers or build in a lab because the parts are "non-local"—meaning every part talks to every other part instantly, like a telepathic network. It's like trying to build a house where every brick is magically connected to every other brick in the building; it's a nightmare to construct.

The Big Idea of This Paper
The authors asked: "Can we build a simpler, easier-to-handle version of this chaotic machine that still behaves like the real thing?"

They built a new model using bosons (specifically, "hard-core bosons," which act like spins on a magnet). Think of it as swapping the telepathic, non-local bricks for standard, local bricks that only talk to their immediate neighbors. They called this the "Quadratic Spin SYK" model.

Here is what they found, explained through simple analogies:

1. The "Surprise Party" (Quadratic Chaos)

Usually, physicists think that if a machine only has simple, two-part interactions (like two people shaking hands), it should be predictable and orderly. It's like a dance where everyone just holds hands with one partner; it's easy to follow.

However, the authors discovered that even with these simple "handshake" interactions, their machine went wild. It became chaotic.

• The Metaphor: Imagine a room full of people where everyone only shakes hands with one other person. You'd expect a calm, orderly line. Instead, the room suddenly turns into a mosh pit where everyone is scrambling, and information spreads instantly. This was a surprise because "simple" usually means "boring" in physics, but here, simple meant "chaotic."

2. The "Fingerprint" of Chaos (Spectral Statistics)

How do you know a machine is chaotic? You look at its "energy fingerprint."

• Orderly Machine: The energy levels are like a piano where the keys are spaced randomly. Sometimes two notes are very close; sometimes they are far apart. It's a bit messy, but not structured.
• Chaotic Machine: The energy levels are like a perfectly tuned orchestra. They repel each other; no two notes are ever too close. They follow a strict, universal pattern (like a specific rhythm).
• The Result: The authors checked their new "boson" machine and found it had the perfect "chaotic fingerprint." It behaved exactly like the complex, hard-to-simulate fermion version.

3. The "Spaghetti Test" (Operator Growth)

In a chaotic system, if you poke one part of the machine, that "poke" (or information) spreads out like a drop of ink in water, or like a piece of spaghetti uncoiling and filling the whole bowl.

• The Test: They watched how a simple "poke" (a local operator) grew over time.
• The Result: In their model, the "spaghetti" uncoiled rapidly and filled the whole system. They also looked at something called OTOCs (Out-of-Time-Ordered Correlators), which is a fancy way of measuring how much the past has been forgotten. They found that as time went on, the machine "forgot" its initial state completely, becoming statistically independent. In math terms, they call this "Freeness."
• The Analogy: Imagine dropping a red dye into a clear river. In an orderly river, the dye stays in a line. In a chaotic river, the dye swirls, mixes, and eventually turns the whole river a uniform pink, erasing the memory of where the drop started. Their machine did exactly this.

4. The "Almost Perfect" State (Eigenstates)

Finally, they looked at the "states" of the machine (the specific configurations it can be in).

• The Expectation: A truly chaotic machine should look like a "random mess" (Haar-randomness). Every possible configuration is equally likely.
• The Reality: Their machine was almost a random mess, but not quite. It was "weakly ergodic."
• The Analogy: Imagine a shuffled deck of cards. A truly random deck has every card in a completely unpredictable order. Their machine's deck was shuffled very well, but if you looked closely, you might see a tiny, faint pattern that wasn't there in a truly random deck. However, as they made the machine bigger and bigger (adding more cards), that faint pattern disappeared, and it became perfectly random.

Why Does This Matter?

This is a big deal for two reasons:

1. Simplicity: Because this new model uses simple, local interactions (like standard magnets), it is much easier to build on real quantum computers today. We don't need the impossible "telepathic" connections of the old model.
2. Efficiency: It proves you don't need complex, high-level interactions to create chaos. Simple, quadratic interactions are enough to scramble information and mimic the deep physics of black holes and quantum gravity.

In a Nutshell:
The authors built a "lightweight" version of a famous chaotic machine. They proved that even with simple, local rules, the machine still scrambles information perfectly, forgets its past, and behaves like a chaotic system. This gives us a much easier, cheaper, and more practical tool to study the mysteries of quantum chaos and gravity on the quantum computers we have right now.

Technical Summary

1. Problem Statement and Motivation

The Sachdev–Ye–Kitaev (SYK) model is a paradigmatic framework for studying quantum chaos, maximal scrambling, and holographic duality. However, the standard SYK model faces two significant hurdles for simulation and theoretical analysis:

1. Computational Complexity: The Hamiltonian involves all-to-all $q$-body interactions, leading to a term count scaling as $O(N^q)$, which becomes intractable for large $N$.
2. Non-locality in Spin Representation: Mapping the fermionic Majorana operators to spins via the Jordan–Wigner (JW) transformation introduces non-local $\sigma^z$ strings, hindering efficient simulation on quantum hardware and classical spin chains.

The authors ask: Can one construct a simplified, fermion-free, local model that retains the essential chaotic features of the SYK model (Random Matrix Theory statistics, scrambling, and operator growth) while being amenable to efficient simulation? Specifically, they investigate whether quadratic ($q=2$) interactions, which are typically associated with integrability in fermionic systems, can generate chaos when constructed from local spin (hard-core boson) operators.

2. Methodology

The authors introduce and analyze the Quadratic Spin-SYK model ($q=2$), defined by random all-to-all couplings of local spin operators.

• Model Definition:
  The Hamiltonian is constructed using local operators $O_{2a-1} = \sigma^x_a$ and $O_{2a} = \sigma^y_a$ (acting as identity elsewhere), avoiding JW strings.
  $$H_{\text{Spin SYK}_2} = \sqrt{\frac{1}{2N_{\text{spin}}}} \sum_{1 \le i_1 < i_2 \le 2N_{\text{spin}}} i \eta_{i_1 i_2} J_{i_1 i_2} O_{i_1} O_{i_2}$$
  where $J_{i_1 i_2}$ are Gaussian random couplings. The authors distinguish between:

  • Spin SYK$_2$: Includes "self-site" interactions (e.g., $O_1 O_2$ on the same site).
  • gSpin SYK$_2$ (Genuine): Excludes self-site interactions, retaining only true two-body terms between distinct sites.

• Symmetry Analysis:
  The model possesses a global $\mathbb{Z}_2$ symmetry generated by $\Gamma_3 = \bigotimes \sigma^z_i$, which anticommutes with the constituent operators. This splits the Hilbert space into even and odd parity sectors, allowing for block-diagonalization.

• Diagnostic Tools:
  The authors employ a comprehensive suite of chaos diagnostics:

  1. Spectral Statistics: Level spacing ratios ($r$) and Spectral Form Factor (SFF) to test Random Matrix Theory (RMT) universality (GOE/GUE).
  2. Operator Growth: Lanczos coefficients ($b_n$) and Krylov complexity to probe the linear growth characteristic of chaos.
  3. Out-of-Time-Ordered Correlators (OTOCs): Cumulative OTOCs to detect the emergence of freeness (free probability) at late times.
  4. Eigenstate Properties: Fractal dimensions and Stabilizer Rényi Entropy (SRE) to characterize ergodicity and "magic" (non-stabilizerness).

3. Key Contributions and Results

A. Emergence of Quadratic Quantum Chaos

Contrary to the expectation that quadratic ($q=2$) models are integrable (as in the fermionic SYK$_2$), the authors demonstrate that the Spin-SYK$_2$ model exhibits genuine chaotic dynamics.

• Spectral Statistics: The level spacing ratios follow the Gaussian Unitary Ensemble (GUE) distribution for the full model and oscillate between Gaussian Orthogonal Ensemble (GOE) and GUE for the "genuine" model depending on system size parity.
• Spectral Form Factor (SFF): The SFF exhibits the characteristic "ramp-plateau" structure, confirming long-range spectral correlations and the absence of integrability.

B. Krylov Complexity and Operator Growth

• Lanczos Coefficients: The Lanczos coefficients $b_n$ exhibit an initial linear growth ($b_n \propto n$), a hallmark of chaotic systems.
• Krylov Dimension: Due to the $\mathbb{Z}_2$ symmetry, the Krylov space dimension is reduced to roughly half the theoretical maximum. However, the authors observe that operators explore only a fraction of this reduced space, suggesting additional constraints on the accessible Hilbert space.
• Complexity Peak: The Krylov spread complexity shows a pronounced peak before saturation, a signature of chaotic dynamics distinct from integrable systems.

C. Emergence of Freeness (Free Probability)

A major finding is the emergence of asymptotic freeness at late times.

• As local operators evolve under the chaotic Hamiltonian, they become statistically independent of their initial configurations.
• This is diagnosed via the cumulative OTOC, which decays to zero at late times (vanishing as $1/N$ in the thermodynamic limit).
• The spectral density of composite operators converges to the arcsine law (the free convolution of Bernoulli spectra), confirming that the system behaves according to free probability theory even at finite system sizes.

D. "Weakly Ergodic" Eigenstates

While the dynamics are chaotic, the eigenstates do not immediately reach the ideal Haar-random limit at finite sizes.

• Fractal Dimensions & SRE: Mid-spectrum eigenstates show systematic deviations from Haar-random predictions (GUE). The fractal dimension $D_\alpha$ and Stabilizer Rényi Entropy (SRE) are lower than the maximal values expected for fully ergodic states.
• Convergence: These deviations diminish as $N \to \infty$, indicating that the states are "weakly ergodic." They approach Haar-randomness only in the infinite-size limit, constrained by the local nature of the interactions. This contrasts with integrable systems, where SRE remains far below the Haar benchmark.

4. Significance and Implications

1. Minimal Model for Chaos: The paper establishes that quadratic interactions are sufficient to generate quantum chaos if the underlying algebra involves non-commuting local operators (hard-core bosons/spins) rather than fermions. This challenges the notion that high-order interactions ($q \ge 4$) are strictly necessary for chaos.
2. Resource Efficiency: The Spin-SYK$_2$ model is significantly more resource-efficient than the standard SYK model. It avoids the non-local JW strings and has a simpler Hamiltonian structure, making it an ideal candidate for near-term quantum simulations on devices like trapped ions or superconducting circuits.
3. Free Probability in Finite Systems: The observation of freeness at finite $N$ provides a new perspective on quantum ergodicity, linking operator delocalization to free probability theory in a concrete, finite-dimensional setting.
4. Distinction from Integrability: The work clarifies the distinction between "weakly ergodic" chaotic systems (which have local constraints) and fully integrable systems, offering refined metrics (like SRE and fractal dimensions) to classify quantum phases.

Conclusion

The authors successfully demonstrate that a minimal, local, quadratic spin model can replicate the complex chaotic features of the SYK model, including RMT statistics, maximal scrambling signatures, and the emergence of free probability. This "Quadratic Quantum Chaos" offers a promising, experimentally accessible pathway to study information scrambling and quantum complexity on current and future quantum hardware.