REVIEW 4 major objections 3 minor 1 cited by
From phase space to Krylov space, one shell at a time
T0 review · 4 major / 3 minor · reviewed 2026-07-15 · grok-4.5
Pith's one-line read Classical Krylov complexity defined on phase space approximates quantum Krylov complexity at early times until a ħ-dependent Krylov-Ehrenfest depth.
desk verdict Abstract-only: classical phase-space Krylov via Poisson brackets looks coherent and useful for early-time chaos, but the ħ o0 claim and LMG shell results cannot be audited yet. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The classical Lanczos algorithm on phase space (Poisson brackets in place of commutators, phase-space integrals as the inner product) is the central object; it is the ħ → 0 limit of the quantum Krylov construction and furnishes the early-time approximation together with the definition of the Krylov-Ehrenfest scale.
What would settle it
A direct numerical comparison of classical and quantum Krylov complexities in the LMG or FP model at small but finite ħ that shows divergence at a depth substantially different from the predicted n_*(ħ) ∼ log(1/ħ), or that shows the microcanonical classical complexity already failing to track the quantum one inside an integrable energy shell at early times.
Extended reading notes
Core claim
In theories with well-defined semiclassical limits, classical Krylov complexity obtained from the phase-space Lanczos algorithm accurately approximates quantum Krylov complexity at early times, until a Krylov-Ehrenfest depth n ∼ n_*(ħ) that translates into the time scale t_* ∼ λ_K^{-1} log(1/ħ).
Load-bearing premise
That the ħ → 0 limit of the quantum Krylov framework is smooth and that the resulting classical construction remains a faithful early-time proxy for quantum complexity in the models studied.
Editorial extensions
If this is right
- Classical phase-space Krylov complexity can serve as a practical early-time proxy for quantum complexity growth in any system that classicalizes.
- The Krylov-Ehrenfest time t_* ∼ λ_K^{-1} log(1/ħ) supplies a universal scale at which classical and quantum Krylov complexities must diverge in chaotic systems.
- Microcanonical Krylov complexities diagnose, shell by shell, whether operator growth is chaotic or integrable.
- In the LMG model the saddle-dominated scrambling is confined to a narrow spectral window; outside that window microcanonical complexity remains integrable-like at all times.
Reading between the lines
- The same phase-space Lanczos construction can be applied to classical field theories with a well-defined Poisson structure, giving a purely classical diagnostic of operator growth before any quantization.
- Extracting the Krylov-Ehrenfest scale from complexity growth and comparing it with the ordinary Ehrenfest time obtained from wave-packet spreading would test whether the two notions of semiclassical breakdown coincide.
- Restricting spectral form factors or out-of-time-order correlators to the same microcanonical shells that show integrable Krylov complexity should likewise reveal integrable rather than chaotic signatures away from the LMG saddle.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript develops a classical Lanczos algorithm that defines Krylov complexity from the symplectic structure of phase space, with Poisson brackets replacing commutators and phase-space integrals supplying the inner product. Using general methods of quantum mechanics in phase space, it claims that the ħ → 0 limit of the quantum Krylov/Lanczos framework passes smoothly into this classical construction. In systems with well-defined semiclassical limits, classical Krylov complexity is argued to approximate quantum Krylov complexity at early times, up to a Krylov-Ehrenfest depth n ∼ n_*(ħ) corresponding to t_* ∼ λ_K^{-1} log(1/ħ). Microcanonical (energy-shell) versions of both classical and quantum Krylov complexity are introduced. The framework is applied to the Lipkin-Meshkov-Glick (LMG) and Feingold-Peres (FP) collective spin models; the abstract states that LMG’s early-time saddle-dominated scrambling is resolved, shell by shell, by the integrable structure of the Hamiltonian away from the instability.
Significance. If the claimed smooth semiclassical correspondence and early-time approximation hold with controlled errors, the work supplies a practical classical diagnostic of early-time chaotic dynamics and a fine-grained, energy-shell probe of complexity growth. The notions of Krylov-Ehrenfest depth/time and microcanonical Krylov complexity are potentially useful conceptual tools for collective spin systems that classicalize in the thermodynamic limit. The LMG application, if substantiated, would clarify how saddle-dominated scrambling coexists with integrable structure off the saddle. These strengths are conditional on the derivations and numerical evidence that the abstract only announces.
major comments (4)
- The central load-bearing claim—that the ħ → 0 limit of the quantum Krylov/Lanczos framework is smooth and that the resulting classical construction (Poisson brackets + phase-space inner product) remains a faithful early-time proxy up to n ∼ n_*(ħ)—is asserted via “general methods of quantum mechanics in phase space” but cannot be audited from the abstract alone. A controlled remainder estimate or explicit comparison of Lanczos coefficients (or complexity growth) as ħ → 0 is required for the correspondence to support the paper’s main conclusions.
- The claimed scaling t_* ∼ λ_K^{-1} log(1/ħ) and the associated Krylov-Ehrenfest depth n_*(ħ) are stated as results. Without the derivation of how n_* is extracted from the classical/quantum Krylov chains, and without quantitative evidence that classical and quantum complexities track until that scale and diverge thereafter, the early-time approximation claim remains unverified.
- For LMG, the abstract asserts that microcanonical Krylov complexity resolves the saddle instability because off-saddle shells are controlled by integrable structure, both at early and late times. This is a modeling claim that is load-bearing for the LMG application; it needs explicit shell-resolved classical and quantum data (and a clear definition of the microcanonical ensembles) to show that residual chaos or saddle contamination does not dominate the reported shells.
- The FP application is said to feature spectral chaos for some couplings, yet the abstract does not indicate how classical vs. quantum microcanonical Krylov complexity distinguishes chaotic from non-chaotic regimes, nor what quantitative diagnostics (e.g., growth rates, late-time plateaus) are used. Without those comparisons the claim that classical Krylov complexity is a useful early-time characteristic of chaos cannot be assessed.
minor comments (3)
- The abstract is dense and packs several new definitions (classical Lanczos recursion, Krylov-Ehrenfest time/depth, microcanonical Krylov complexity) without a one-sentence roadmap of the paper’s section structure; a clearer outline sentence would help readers.
- Notation for the classical inner product and the precise replacement of the quantum Liouvillian by the classical Liouville operator should be fixed early and used consistently once the full text is available.
- When the full manuscript is supplied, figures comparing classical and quantum Krylov complexity (and shell-resolved versions) with explicit ħ or large-spin scaling would be essential; the abstract alone cannot convey error bars or the quality of the early-time match.
Circularity Check
No significant circularity detectable from abstract-only text; classical Krylov construction is definitional and compared to quantum counterpart rather than fitted to it.
full rationale
Only the abstract is available, so no equations, self-citations, uniqueness theorems, or fitted parameters can be audited. From the abstract alone the construction is definitional: classical Krylov complexity is introduced via the symplectic structure (Poisson brackets replacing commutators, phase-space integrals as the inner product), the ħ o0 limit is claimed to recover this object from the quantum Lanczos framework by general methods of quantum mechanics in phase space, and the classical object is then compared to quantum Krylov complexity as an early-time approximation up to a Krylov-Ehrenfest depth. Microcanonical shells are likewise defined and applied to LMG/FP without any indication that parameters are fitted to produce the claimed approximation or the resolution of LMG saddle instability. No self-definitional loop, fitted-input-as-prediction, load-bearing self-citation, imported uniqueness theorem, smuggled ansatz, or renaming of a known result is exhibited by the available text. Residual risk that λ_K or n_*(ħ) might be extracted from the same dynamics is not circularity under the stated rules; it is ordinary use of the model. Score 0 is therefore the honest finding given the evidence.
Assumptions & free parameters
free parameters (2)
- model couplings and large-spin parameter (LMG/FP)
- Krylov depth cutoff / n_*(ħ) scale
assumptions (4)
- domain assumption Poisson brackets and phase-space integrals define a valid Lanczos recursion analogous to quantum commutators and Hilbert-space inner products.
- domain assumption The ħ → 0 limit of the quantum Krylov framework is smooth and yields the classical construction.
- domain assumption LMG and FP classicalize in the thermodynamic/large-spin limit, with FP spectral chaos in a coupling window and LMG saddle-dominated early scrambling.
- standard math Standard symplectic geometry and Hamiltonian phase-space structure.
invented entities (2)
-
Krylov-Ehrenfest time / depth n_*(ħ)
-
Microcanonical Krylov complexity (classical and quantum)
Cite this review
Pith. "Pith review of From phase space to Krylov space, one shell at a time." pith.science (2026). https://pith.science/paper/4DO7OPIA
@misc{pith2026260712585,
author = {Pith},
title = {Pith review of: From phase space to Krylov space, one shell at a time},
year = {2026},
howpublished = {\url{https://pith.science/paper/4DO7OPIA}},
note = {Machine review of arXiv:2607.12585}
}
abstract
In this work, we develop and study the classical Lanczos algorithm allowing us to define Krylov complexity using the symplectic structure of phase space: Poisson brackets take on the role of the quantum commutators and phase-space integrals furnish the inner product needed to define the Lanczos recursion. We show, using general methods of quantum mechanics in phase space, that the $\hbar \to 0$ limit of the usual quantum mechanical Krylov framework smoothly goes over into the classical one. In theories with well-defined semiclassical limits, we show that classical Krylov complexity accurately approximates quantum complexity at early enough times, and thus is a useful characteristic of early-time chaotic dynamics. We define a Krylov-Ehrenfest time, which quantifies the eventual divergence of classical and quantum complexities, corresponding to a characteristic depth of the Krylov chain, $n\sim n_*(\hbar)$, which in the time domain translates to the well-known scale, $t_*\sim\lambda_K^{-1}\log(1/\hbar)$, in generic chaotic systems. We additionally define microcanonical Krylov complexities, both in the classical and quantum setting, which allows one a fine-grained study of complexity, energy shell by energy shell. We apply this framework to the Lipkin-Meshkov-Glick (LMG) and Feingold-Peres (FP) models, which are collective spin systems known to classicalize in the thermodynamic limit. In particular, while the FP model features spectral chaos for some range of coupling values, the LMG model is known to exhibit early-time saddle-dominated scrambling. Our analysis shows that the instability in LMG is resolved by the microcanonical Krylov complexity, which is controlled by the integrable structure of the Hamiltonian in spectral windows away from the instability, both at early and late times.
Forward citations
Cited by 1 Pith paper
-
Recursion Coefficients and Krylov Dynamics in Polynomial Random Matrix Models
Recursion coefficients for high-degree asymmetric polynomial random matrix models are computed efficiently via a moment recursion, with large-n asymptotics reproducing Freud's conjecture and transition regions mapped ...
Reviewed July 15, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.