arXiv subjects

Le-Chen Qu

Publications and source records attributed to Le-Chen Qu.

9 recordsLinked to original sources

arXiv2026

Quantum chaos and late-time equipartition of symmetry-resolved Krylov complexity

We study symmetry-resolved Krylov complexity in finite-dimensional chaotic quantum many-body systems. When both the Hamiltonian and the initial operator commute with a conserved charge, the operator dynamics decomposes into independent symmetry sectors, each with its own Krylov chain. We show that, after saturation, the unresolved Krylov complexity is additive over symmetry sectors. In the absence of additional Liouvillian degeneracies, the late-time contribution of a sector with Hilbert-space dimension $d_q$ is controlled by $d_q(d_q-1)$, leading to a dimension-weighted equipartition that approaches the simple large-sector scaling $d_q^2/\sum_{q'}d_{q'}^2$. This late-time rule differs from the early-time weighted-average discussed in the literature and is governed instead by the dimensions of the accessible operator spaces. We support the analytic prediction with numerical studies of the real and complex SYK models, a chaotic bosonic spin model, and the mixed-field Ising chain. Our results show that resolving exact symmetries is essential for interpreting the saturation value of Krylov complexity as a diagnostic of chaotic operator growth.

hep-th↗

arXiv2026

A geodesic distance interpretation of Lanczos coefficients

We study the spread complexity of the infinite-temperature thermofield double state in large-$N$ random matrix theory and investigate the physical meaning of its Lanczos coefficients $b_n$. The leading density of states defines a family of orthogonal polynomials whose recursion coefficients coincide with the Lanczos coefficients of the associated Krylov dynamics. Starting from the Coulomb-gas equation, we derive a pair of nonlinear relations for these coefficients, which we call the Lanczos equations. For normalizable one-cut ensembles, the Lanczos coefficients approach constants at large Krylov index, rendering the asymptotic Krylov chain translationally invariant and the late-time growth of spread complexity linear, with the growth rate given by the spectral average of the group velocity obtained from a Bloch-wave analysis. For an even potential, we further show that the difference between consecutive squared Lanczos coefficients, $b_{n+1}^2-b_n^2$, is the generating function for two-legged maps whose marked legs are separated by the exact geodesic distance $n$. Consequently, the spread complexity acceleration operator equals twice the geodesic generating operator. We illustrate these results in the quartic matrix model, where the expansion in the quartic coupling counts tetravalent planar maps, and in the double-scaled Sachdev--Ye--Kitaev model, where the auxiliary Hilbert space can be identified with the physical chord Hilbert space.

hep-th↗

arXiv2026

Recursion Coefficients and Krylov Dynamics in Polynomial Random Matrix Models

We study the recursion coefficients of orthogonal polynomials and their associated Krylov dynamics in random matrix models with high-degree and possibly asymmetric polynomial potentials. We develop a moment recursion method that, when combined with the recursive algorithm, provides an efficient construction of the recursion coefficients. We also obtain their large-$n$ asymptotic behavior for general asymmetric potentials; for $Nw_d=1$, the leading asymptotic form of $R_n$ reproduces Freud's conjecture. We apply this framework to an asymmetric quartic potential and to the double-scaled Sachdev-Ye-Kitaev (DSSYK) model. In both models, the recursion functions capture the overall qualitative behavior of the recursion coefficients, and the gradient catastrophes of the recursion functions are associated with ``chaotic'' transition regions in the recursion coefficients. For the quartic potential, such regions can occur in both $R_n$ and $S_n$, whereas the DSSYK model can exhibit multiple transition regions in $R_n$, with the recursion function remaining accurate in the smooth intervals between them. Finally, we compute the corresponding spread complexity and find that transition regions do not qualitatively modify its behavior, while a two branch structure produces early time oscillations followed by monotonic growth.

hep-th↗

arXiv2025

Lanczos Meets Orthogonal Polynomials

We establish a direct correspondence between the Lanczos approach and the orthogonal polynomials approach in random matrix theory. In the large-$N$ and continuum limits, the average Lanczos coefficients and the recursion coefficients become equivalent, with the precise mapping $b(1-x)=\sqrt{R(x)}$ and $a(1-x)=S(x)$. As a result, the two formalisms yield identical expressions for the leading density of states. We further analyze the Krylov dynamics associated with the recursion coefficients and show that the orthogonal polynomials admit a natural interpretation as Krylov polynomials. This picture is realized explicitly in the Gaussian Unitary Ensemble, where all quantities can be computed analytically.

hep-th↗

arXiv2025

Explicit Connections Between Krylov and Nielsen Complexity

We establish a direct correspondence between Krylov and Nielsen complexity by choosing the Krylov basis to be part of the elementary gate set of Nielsen geometry and selecting a Nielsen complexity metric compatible with the Krylov metric. Up to normalization, the Krylov complexity of a Hermitian operator then equals the length squared of a straight-line trajectory on the manifold of unitaries that connects the identity operator with a precursor operator. The corresponding length provides an upper bound on Nielsen complexity that saturates whenever the straight line is a minimal geodesic. While for general systems we can only establish saturation in the limit of small precursors, we provide evidence that in broad classes of models and for suitable initial operators there is a precise correspondence between Krylov complexity and (the square of) Nielsen complexity for a finite range of precursors.

hep-th↗

arXiv2024

Kasner interiors from analytic hairy black holes

We conduct an exhaustive study of the interior geometry of a family of asymptotically AdS$_{d+1}$ hairy black holes in an analytically controllable setup. The black holes are exact solutions to an Einstein-Maxwell-Dilaton theory and include the well-known Gubser-Rocha model. After reviewing the setup, we scrutinize the geometry beyond the horizon, finding that these backgrounds can exhibit timelike or Kasner singularities. We generalize the no inner-horizon theorem for hairy black holes to accommodate these findings. We then consider observables sensitive to the geometry behind the horizon, such as Complexity = Anything and the thermal $a$-function. In the Kasner case, we propose a new variant of complexity that characterizes the late-time rate by the Kasner exponents, extending previous work by J{\o}rstad, Myers and Ruan. Additionally, we elucidate the power-law behavior of the thermal $a$-function near the singularity, directly relating it to the Kasner exponents. Finally, we introduce axion-like fields in the Gubser-Rocha model to study the impact of translational symmetry breaking on the black hole interior. We show that Kasner singularities occur for both explicit and spontaneous symmetry breaking, with the Kasner exponents depending on the strength of broken translations only in the latter case.

hep-th↗

arXiv2024

Krylov complexity of density matrix operators

Quantifying complexity in quantum systems has witnessed a surge of interest in recent years, with Krylov-based measures such as Krylov complexity ($C_K$) and Spread complexity ($C_S$) gaining prominence. In this study, we investigate their interplay by considering the complexity of states represented by density matrix operators. After setting up the problem, we analyze a handful of analytical and numerical examples spanning generic two-dimensional Hilbert spaces, qubit states, quantum harmonic oscillators, and random matrix theories, uncovering insightful relationships. For generic pure states, our analysis reveals two key findings: (I) a correspondence between moment-generating functions (of Lanczos coefficients) and survival amplitudes, and (II) an early-time equivalence between $C_K$ and $2C_S$. Furthermore, for maximally entangled pure states, we find that the moment-generating function of $C_K$ becomes the Spectral Form Factor and, at late-times, $C_K$ is simply related to $NC_S$ for $N\geq2$ within the $N$-dimensional Hilbert space. Notably, we confirm that $C_K = 2C_S$ holds across all times when $N=2$. Through the lens of random matrix theories, we also discuss deviations between complexities at intermediate times and highlight subtleties in the averaging approach at the level of the survival amplitude.

hep-th↗

arXiv2022

Chaos and multifold complexity for an inverted harmonic oscillator

We examine the multifold complexity and Loschmidt echo for an inverted harmonic oscillator. We give analytic expressions for any number of precursors, implementing multiple backward and forward time evolutions of the quantum state, at the leading order in the perturbation. We prove that complexity is dominated by the longest permutation of the given time combination in an alternating ``zig-zag'' order, the exact same result obtained with holography. We conjecture that the general structure for multifold complexity should hold true universally for generic quantum systems, in the limit of a large number of precursors.

quant-ph↗

arXiv2021

Chaos and Complexity for Inverted Harmonic Oscillators

We investigate the circuit complexity and Loschmidt echo for the (inverted) harmonic oscillators. Focusing on the chaotic behaviors under the perturbation, we analytically derive the Lyapunov exponent and scrambling time of the inverted harmonic oscillators. We show that the circuit complexity and Loschmidt echo exhibit qualitatively similar behaviors, particularly the consistent Lyapunov exponent.

hep-th↗