arXiv subjects

Eric L Graef

Publications and source records attributed to Eric L Graef.

3 recordsLinked to original sources

arXiv2026

Krylov complexity from a simple quantum mechanical model for a radiating black hole

We investigate Krylov complexity in a simple quantum mechanical model describing a black hole coupled to its radiation. The model is constructed as a simplified ``mini-BMN" matrix system inspired by a recent proposal of Maldacena. Our aim is not to reproduce the full dynamics of the BMN matrix model, but rather to isolate a tractable setting in which the information-theoretic behaviour of a radiating black hole can be studied explicitly. We analyze both the early- and late-time behaviour of Krylov complexity and the associated Krylov entropy. At early times, perturbative and numerical analyses reveal the expected growth characteristic of chaotic quantum dynamics. At late times, however, the dynamics saturates to a plateau, consistent with equilibration between the black hole and its radiation and with general expectations from finite-entropy quantum systems. We argue that this plateau behaviour admits a semiclassical interpretation in terms of Euclidean instanton contributions in an effective path-integral. The toy model studied here offers a controlled framework in which these features can be investigated analytically and numerically.

hep-th↗

arXiv2025

Krylov complexity, path integrals, and instantons

Krylov complexity has emerged as an important tool in the description of quantum information and, in particular, quantum chaos. Here we formulate Krylov complexity $K(t)$ for quantum mechanical systems as a path integral, and argue that at large times, for classical chaotic systems with at least two minima of the potential, that have a plateau for $K(t)$, the value of the plateau is described by quantum mechanical instantons, as is the case for standard transition amplitudes. We explain and test these ideas in a simple toy model.

hep-th↗

arXiv2025

A Quantum Computational Perspective on Spread Complexity

We establish a direct connection between spread complexity and quantum circuit complexity by demonstrating that spread complexity emerges as a limiting case of a circuit complexity framework built from two fundamental operations: time-evolution and superposition. Our approach leverages a computational setup where unitary gates and beam-splitting operations generate target states, with the minimal cost of synthesis yielding a complexity measure that converges to spread complexity in the infinitesimal time-evolution limit. This perspective not only provides a physical interpretation of spread complexity but also offers computational advantages, particularly in scenarios where traditional methods like the Lanczos algorithm fail. We illustrate our framework with an explicit SU(2) example and discuss broader applications, including cases where return amplitudes are non-perturbative or divergent

hep-th↗