Pith. sign in

REVIEW 5 major objections 5 minor 25 references

Statistical features of quantum chaos using the Krylov operator complexity

T0 review · 5 major / 5 minor · reviewed 2026-08-12 · deepseek-v4-flash

Pith's one-line read The paper argues that the statistical spread of an operator in Krylov space is universal: sampling random initial operators makes the log-ratio Lanczos coefficients approximately multivariate normal, the sample correlation matrix…

desk verdict Worth engaging for its new ensemble observables and the two-group splitting, but the Wishart/chi-square claims rest on an unproven normality ansatz and the numerics only test marginals. read the letter →

arxiv 2411.18436 v3 pith:J7OG7ZQ4 submitted 2024-11-27 quant-ph hep-th

classification quant-phhep-th
keywords KrylovcomplexityLanczoscoefficientsWishartdistributionchi-squarerandommatrixtheoryAndersonlocalizationquantumchaosoperatorgrowth
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper tries to establish that the noise in Krylov operator growth is not arbitrary but obeys universal statistical laws. Concretely, for a fixed Hamiltonian, if you draw many initial operators from standard random-matrix ensembles (GOE, GUE, or uniform), the log-ratio Lanczos coefficients $x_i = \ln|b_{2i-1}/b_{2i}|$ form an approximately normal random vector, the sample correlation matrix $\langle x_i x_j\rangle$ follows a Wishart distribution, and the variance $\sigma^2$ of those coefficients follows a rescaled chi-square distribution. These laws are claimed to be independent of the initial-operator distribution and to become Gaussian as the operator dimension grows. The payoff is a statistical signature of quantum chaos that ties random matrix theory to Anderson localization on the Krylov chain and to Krylov complexity, and that visibly separates integrable from chaotic billiards.

What carries the argument

The object that carries the argument is the vector $\vec{X}=(x_1,\dots,x_K)$ of log-ratio Lanczos coefficients, $x_i = \ln|b_{2i-1}/b_{2i}|$, treated as a zero-mean multivariate normal random vector over the ensemble of initial operators. From this normal ansatz the sample correlation matrix $\langle x_i x_j\rangle$ becomes a Wishart matrix, and the variance $\sigma^2$ becomes a rescaled chi-square variable once the off-diagonal terms in $\sigma^2$ are dropped. A supporting lemma shows by induction that every Krylov-basis matrix element depends only on the energy levels and the initial random matrix, which supplies the central-limit intuition for why the coefficients should look normal; the mapping of the Krylov dynamics to a one-dimensional chain with hopping amplitudes $b_n$ then links these statistics to Anderson localization.

What would settle it

Sample initial operators from a distribution with heavy tails (for example, Student's t with a few degrees of freedom) for a fixed chaotic Hamiltonian and test whether the empirical distribution of $\sigma^2$ is still rescaled chi-square; a detectable departure would falsify the claimed independence from the initial-operator distribution. A sharper check: apply a multivariate normality test to the sampled vectors $\vec{X}$; strong rejection at large $N$ would invalidate the Wishart derivation at its root.

Watch

Extended reading notes

Core claim

The central claim is that the ensemble statistics of Lanczos coefficients are universal for chaotic dynamics. Under the ansatz that $\vec{X} = (x_1,\dots,x_K)$ with $x_i = \ln|b_{2i-1}/b_{2i}|$ is a zero-mean multivariate normal random vector across samples of initial operators, the empirical correlation matrix $\langle x_i x_j\rangle$ is a sample covariance matrix and therefore has a Wishart distribution $W_K(\Sigma,N)$, while the variance $\sigma^2 = \mathrm{Var}(x_i)$ collapses to a rescaled chi-square variable when off-diagonal correlations are neglected. The paper argues that both distributions do not depend on which random-matrix ensemble the initial operator is drawn from, and that they become normal distributions for large matrix size because many random numbers enter the Krylov construction. In the Sinai billiard, the two quantities change character between integrable ($a=0$) and chaotic ($a=1$) parameter regimes, while the Stadium billiard behaves like the chaotic Sinai case throughout.

Load-bearing premise

The argument collapses if the log-ratio Lanczos coefficients do not behave as a zero-mean multivariate normal random vector across the sampled initial operators, an assumption the paper motivates but does not derive from the dynamics.

Editorial extensions

If this is right

  • The average correlation matrix and the variance distribution of Lanczos coefficients become ensemble-level probes of chaos that do not require choosing a particular initial operator.
  • In the large-matrix limit these distributions are normal, so the mean and variance of $\sigma^2$ are sufficient statistics for the ensemble, simplifying the numerical characterization of chaos.
  • The cross-like pattern in $\langle x_i x_j\rangle$ for the integrable Sinai billiard, locally resembling two-electron Anderson-localization correlations, ties the statistics directly to localization physics on the Krylov chain.
  • The split of $f_{\sigma^2}$ into two well-separated groups (GOE/URE/UIM versus GUE/UCP) in the chaotic Sinai billiard indicates a real-versus-complex distinction in the random initial operators that persists in the statistics.
  • The proposed duality between random initial operators with fixed Hamiltonian and fixed operators with random-matrix Hamiltonians suggests that the same ensemble statistics control the late-time saturation of Krylov complexity.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Inference: the paper demonstrates the Wishart/chi-square laws only in the isotropic case where the underlying covariance $\Sigma$ is effectively the identity; a natural test is to engineer a Hamiltonian or a sampling scheme with a non-trivial $\Sigma$ and check whether the full matrix structure of the Wishart density is reproduced.
  • Inference: if the normality ansatz holds beyond billiards, the distribution of $\sigma^2$ could serve as a chaos probe in many-body or holographic settings where traditional level statistics are hard to compute, since the variance only requires Lanczos coefficients from a single operator sample.
  • Inference: the real-versus-complex two-group separation looks like a manifestation of Dyson's threefold way, and one could test it by adding a time-reversal-breaking term to the Sinai billiard and watching the GUE-like group merge or split.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

5 major / 5 minor

Summary. The paper studies statistical properties of Lanczos coefficients in Krylov operator complexity, over ensembles of random initial operators. It proposes two quantities: the average correlation matrix ⟨x_i x_j⟩ and the distribution f_{σ²} of the variance σ² of the log-ratio Lanczos coefficients x_i. The central claim, stated in the abstract and developed in Section 3, is that ⟨x_i x_j⟩ follows a Wishart distribution and σ² follows a rescaled chi-square distribution, independent of the distribution of initial operators, and that both become normal for large matrix size. The numerical examples are Sinai and Stadium billiards with GOE, GUE, and uniform-distribution initial operators. The paper reports agreement with these distributional predictions and uses the quantities to distinguish chaotic from nonchaotic behavior, connecting RMT, Anderson localization, and Krylov complexity.

Significance. If the distributional claims were established, they would provide a genuinely useful, potentially universal statistical characterization of Lanczos coefficients, connecting operator growth in Krylov space to random matrix theory and Anderson localization. The paper has notable strengths: Lemma 1 explicitly identifies the dependence of Lanczos coefficients on initial operators and energy levels; the assumption behind the Wishart/chi-square claims is stated transparently; and the numerical appendix is extensive, including fitted distributions, skewness/kurtosis values, and robustness checks with different Lanczos windows. The main weakness is that the load-bearing premise, the multivariate normality of X = (x_1, ..., x_K), is assumed rather than derived, and the numerical verification presented tests only univariate marginals, not the joint Wishart structure. The paper is therefore best read as a phenomenological proposal whose central claim is plausible but not yet conclusively supported.

major comments (5)
  1. [Section 3.2, Eq. (3.13)] The Wishart result M = X^T X ~ W_K(Σ, N) is a direct mathematical consequence of assuming that the vectors X_i are independent draws from N_K(0, Σ). It is not derived from Lemma 1, which only shows that each Lanczos coefficient is a deterministic function of the initial operator and energy levels. Lemma 1 does not imply that these nonlinear functions are jointly Gaussian. Since all subsequent distributional claims rest on this ansatz, the paper should either provide a derivation or a quantitative justification of the Gaussian approximation, or explicitly and consistently frame the contribution as a phenomenological model conditional on the normality ansatz.
  2. [Section 4.1, Figures 2 and 3] The numerical verification is weaker than claimed. Figure 2(a,c) and Figure 3(a,c) test only the diagonal marginals ⟨x_i²⟩ and the scalar variance σ²; no off-diagonal entry ⟨x_i x_j⟩ with i ≠ j is compared to the Wishart density, and no test of the joint distribution of M is reported. Consequently, the numerics cannot distinguish the multivariate normal hypothesis from other distributions sharing the same marginals. A direct test of the Wishart structure, for example by comparing the empirical distribution of off-diagonal entries of M to the predicted Wishart density or by using a Wishart likelihood/QQ diagnostic, is needed to support the central claim.
  3. [Section 3.3, Eqs. (3.17)-(3.18)] The neglect of the cross term ∑_{i≠j} x_i x_j is justified only by the assertion that it is 'smaller than the first term by at least one order of magnitude', with no supporting calculation. If the x_i are correlated, σ²_O is not a rescaled chi-square variable but a generalized chi-square with parameters depending on the full covariance Σ. Moreover, the simplified chi-square result assumes independence of the x_i, and this independence is not tested in the paper. The authors should quantify the cross-term contribution and provide evidence for independence or fit the full covariance structure.
  4. [Section 3.2, paragraph after Eq. (3.16)] The statement that 'the distributions of initial operators are univariate, whose Σ is the identity matrix' conflates the elementwise distribution of the initial random matrix with the covariance structure of the derived vector X. In the model N_K(0, Σ), Σ is the covariance among the x_i components, not the covariance among entries of O(0). This conflation is load-bearing because it is used to reduce the Wishart claim to a univariate chi-square statement. The authors should clarify what exactly is assumed about Σ and provide numerical evidence that Σ is diagonal, or at least that the off-diagonal structure does not affect the conclusions.
  5. [Abstract and Section 5] The claimed independence of the statistics from the initial operator distribution is overstated. Table 1 and Figure 5a show that the fitted mean of σ² depends strongly on the initial operator ensemble (GOE vs. GUE vs. UCP) in the chaotic Sinai billiard. What appears to be universal is only the functional form of the distribution, not its parameters. The paper should state this distinction clearly, since the phrase 'independent of the distributions of initial operators' invites the stronger reading that the entire distribution is ensemble-independent.
minor comments (5)
  1. [Section 3.2, Eq. (3.13)] The notation is inconsistent: M = X^T X is the scatter matrix, while the average correlation matrix is ⟨x_i x_j⟩ = M_{ij}/N. The distribution stated, W_K(Σ, N), applies to M, not to M/N, so the rescaled distribution of ⟨x_i x_j⟩ should be stated explicitly.
  2. [Section 2, Lanczos algorithm] There is a typo: 'nubmers' should be 'numbers'.
  3. [Section 4.1, Figure 2] The y-axis labels in Figures 2(b) and 2(d) read '⟨x_i²⟩' even though the text describes the histogram of ⟨x_i x_j⟩; the labels should be corrected.
  4. [Section 4.1, first paragraph] The phrase 'if K = Σ = 1' is awkward and potentially confusing, since K is the dimension of the Wishart distribution and Σ is its scale matrix; a clearer statement would be 'in the one-dimensional case with unit variance'.
  5. [Appendix, Section [II]] The appendix states that for the Stadium billiard there is no overlapping behavior in the nonchaotic case, but Figure 6a indeed shows separated groups; this is consistent, but the wording could be made clearer to avoid apparent contradiction with the Sinai discussion.

Circularity Check

3 steps flagged · score 6.0 of 10

Wishart/chi-square claims are the multivariate-normal ansatz restated (Sec. 3.2-3.3); the numerics verify only fitted diagonal marginals, so the central predictions reduce by construction.

  1. self definitional [Section 3.2, Eqs. (3.12)-(3.15)]
    "After accepting the randomness of xi, we go one step further by assuming that the K-component random vector ⃗X = (x1, . . . , xK) is from a multivariate normal distribution NK(0, Σ) ... Then the sample covariance matrix M is a symmetric square matrix of size K defined as M = X^T X = Σ_i ⃗X_i^T ⃗X_i ∼ WK(Σ, N), which has the probability distribution WK(Σ, N) known as the Wishart distribution."

    The Wishart distribution is, by definition, the distribution of the sample covariance matrix M = Σ_i X_i^T X_i of i.i.d. multivariate-normal vectors. Eq. (3.13) is therefore not a derived prediction: given the paragraph's assumption X ~ N_K(0,Σ), the statement M ~ W_K(Σ,N) is the defining property of the Wishart law restated for the Lanczos-coefficient vector. The abstract's headline claim that ⟨x_ix_j⟩ 'satisfies the Wishart distribution' is exactly the undemonstrated multivariate-normality ansatz, and the claimed independence of the initial-operator distributions is just that ansatz asserted to hold for every input distribution. Lemma 1 (Eqs.

  2. fitted input called prediction [Section 3.3, Eqs. (3.17)-(3.18) and following paragraph]
    "Qualitatively, we can expect that the second term with i ≠ j can be neglected compared with the first term. ... But in the simple case when xi are independent random variables from a univariate normal distribution N (0, σx), we can scale xi by an overall factor to make its standard deviation being 1 and the resulting distribution fσ2 of the variance (3.18) is proportional to the chi-square distribution by an overall factor."

    Eq. (3.17) expresses σ² as a diagonal term minus cross terms; the cross terms are discarded on the assertion that 'the second term is smaller than the first term by at least one order of magnitude,' with no calculation shown. Under the resulting σ² ≈ (1/p − 1/p²) Σ x_i², the distribution is a rescaled chi-square only when the x_i are independent normals, which is precisely the 'simple case' assumed in this passage. A sum of squares of independent unit normals is the definition of the chi-square distribution, so the abstract's chi-square claim adds nothing to the i.i.d.-normal ansatz except an 'overall factor' fitted to the simulated histograms (Figs. 3, 13-14).

1 more flagged steps
  1. self definitional [Section 4.1, Figure 2]
    "if K = Σ = 1, it reduces to the chi-squared distribution with N degrees of freedom. However, this is exactly the case in the numerical example: the distributions of initial operators (4.3)-(4.5) are univariate, whose Σ is the identity matrix. So it is natural to expect that the resulting K-component random vector ⃗X is also univariate, that is, the multivariate normal distribution NK(0, Σ) of ⃗X reduces to a univariate normal distribution N (0, σx)."

    The numerical verification collapses the Wishart claim to a univariate check: because the initial random matrices (4.3)-(4.5) are 'univariate, whose Σ is the identity matrix,' the paper infers that X is also univariate, so the Wishart law reduces to the chi-square law of the single diagonal marginal ⟨x_i²⟩. This conflates the covariance of the initial matrix elements with the covariance Σ of the derived nonlinear vector X; yet Figure 4b shows large off-diagonal |⟨x_i x_j⟩| in the nonchaotic Sinai case, contradicting Σ = I. No off-diagonal entry is ever compared with the Wishart density (3.15); Figures 2a/2c histogram only ⟨x_i²⟩. One-marginal fits cannot distinguish multivariate normality from other distributions with equal marginals, so the joint Wishart structure is never tested.

full rationale

The paper's own equations exhibit the reduction. Section 3.2 states the assumption that the K-vector X of log-ratio Lanczos coefficients is multivariate normal, and Eq. (3.13) immediately gives M = X^T X ~ W_K(Σ,N); because the Wishart law is by definition the distribution of the sample covariance of i.i.d. normal vectors, the abstract's headline claim that ⟨x_ix_j⟩ 'satisfies the Wishart distribution' is that ansatz restated, not a derived consequence. Lemma 1 establishes only functional dependence of Krylov matrix elements on energy differences and the initial matrix; it provides no Gaussianity, and the Section 3.1 central-limit remarks are heuristic. Section 3.3 obtains the rescaled chi-square only in the 'simple case' of independent normals, after discarding the cross terms in Eq. (3.17) on an unproven order-of-magnitude assertion, and the 'overall factor' is fitted from the histograms (Figures 3, 13, 14). Section 4.1 then reduces the Wishart verification to the chi-square histogram of one diagonal marginal, asserting Σ = I for the derived vector X from the entrywise independence of the initial matrices; no off-diagonal ⟨x_ix_j⟩ entry is ever tested against the Wishart density (3.15), and the authors' own Figure 4b shows substantial off-diagonal structure in the nonchaotic Sinai case. The paper is candid that the analysis is 'phenomenological' and that the Nmax = 5 rescaled-chi-square fit is a top-down consistency check rather than a bottom-up derivation; that passage confirms the fitted form, not the underlying hypothesis. There is no load-bearing self-citation: the support for normality cited from previous work [4, 6] is external, and the genuinely non-circular content — universality across five initial-operator distributions, the chaotic/nonchaotic pattern differences, and the Anderson-localization correlation comparison — is real empirical evidence that does not reduce by construction. Nevertheless, the two central distributional claims reduce by construction to the multivariate-normality ansatz, so the paper is partially circular: score 6.

Assumptions & free parameters 4 free parameters · 6 assumptions · 0 invented entities

The central statistical claims rest on the ansatz that the log-ratio Lanczos coefficients are drawn from a multivariate normal distribution, plus an independence approximation and the neglect of cross terms in the variance. These are not derived from the Hamiltonian; the numeric support consists of histogram fits. No new physical entities are introduced.

free parameters (4)
  • Nmax truncation = 50 for ⟨xixj⟩, 100 for fσ²
    The number of energy levels kept in the truncated Hamiltonian; the paper states Nmax=50 is empirically enough for normal statistics and Nmax=100 for fσ² to match Ref. [13].
  • K (number of Lanczos coefficients) = K = 5Nmax
    The number of Lanczos coefficients selected for computing the correlation matrix and variance; set in consistency with Ref. [13].
  • Variance window = 5Nmax ≤ n ≤ 10Nmax (and 10Nmax ≤ n ≤ 15Nmax in the robustness check)
    The Lanczos coefficients used to compute σ² are taken from a specific window of algorithm steps; the paper argues the choice does not qualitatively affect the results (Appendix IV).
  • Fit parameters μ0 and σ0 = Reported in Table 1 for each ensemble and chaos case
    Normal distributions are fitted to the variance histograms for visualization and comparison; these parameters are estimated from the data and are not used in the derivation.
assumptions (6)
  • ad hoc to paper The vector X = (x_1, ..., x_K) of log-ratio Lanczos coefficients is a K-component random vector from a multivariate normal distribution N_K(0, Σ).
    This is the central model assumption stated in Section 3.2. It is justified by analogy with Anderson localization, central limit intuition, and previous numerics, but it is not derived from the Hamiltonian or the Lanczos algorithm.
  • ad hoc to paper The components x_i are independent for the rescaled chi-square result.
    Section 3.3 states that the rescaled chi-square distribution follows only in the simple case when the x_i are independent univariate normal variables. Independence is not proven for actual Lanczos coefficients.
  • domain assumption The cross term (1/p²)Σ_{i≠j} x_i x_j is negligible in the variance formula.
    In Eq. (3.17)-(3.18), the cross term is dropped after arguing it is smaller than the diagonal term by at least an order of magnitude. This is a numerical approximation that may fail for small p or strongly correlated x_i.
  • standard math The central limit theorem applies at Nmax = 50 and Nmax = 100.
    The paper expects the sample statistics to become normal for large matrix size via the central limit theorem; this is used to interpret the histograms in Figures 2 and 3 as normal distributions.
  • domain assumption Sinai and Stadium billiards with Dirichlet boundary conditions are valid model systems for quantum chaos.
    The two billiards are used as standard chaotic systems, relying on the established literature for their spectral statistics. The integrability-breaking parameter a interpolates between integrable and chaotic regimes.
  • standard math The operator inner product (A|B) = tr(A†B) is the appropriate infinite-temperature inner product.
    Section 2 defines this inner product for the Lanczos algorithm; it is standard in the Krylov complexity literature.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Statistical features of quantum chaos using the Krylov operator complexity." pith.science (2026). https://pith.science/paper/J7OG7ZQ4

@misc{pith2026241118436,
  author       = {Pith},
  title        = {Pith review of: Statistical features of quantum chaos using the Krylov operator complexity},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/J7OG7ZQ4}},
  note         = {Machine review of arXiv:2411.18436}
}
abstract

We study the statistical properties of Lanczos coefficients over an ensemble of random initial operators generating the Krylov space. We propose two statistical quantities that are important in characterizing the complexity: the average correlation matrix $\langle x_{i} x_{j}\rangle$ of Lanczos coefficients and the resulting distribution of the variance of Lanczos coefficients. Their resulting statistics are the Wishart distribution and the (rescaled) chi-square distribution respectively, which are independent of the distributions of initial operators and become the normal distribution in the case of large matrix size. As a numerical example, we use the typical billiard system with an integrability-breaking term and choose samples of random initial operators from given probability distributions (GOE, GUE and the uniform distribution). It agrees with the phenomenological analysis and further interesting behaviors are obtained, which indicates a consistent connection between RMT, Anderson localization and Krylov complexity.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

25 extracted references · 15 canonical work pages

  1. [1]

    Parker, X

    D.E. Parker, X. Cao, A. Avdoshkin, T. Scaffidi and E. Altman,A Universal Operator Growth Hypothesis, Phys. Rev. X 9 (2019) 041017 [1812.08657]

  2. [2]

    Maldacena, S.H

    J. Maldacena, S.H. Shenker and D. Stanford,A bound on chaos, JHEP 08 (2016) 106 [1503.01409]

  3. [3]

    Larkin and Y.N

    A.I. Larkin and Y.N. Ovchinnikov,Quasiclassical Method in the Theory of Superconductivity, Soviet Journal of Experimental and Theoretical Physics28 (1969) 1200

  4. [4]

    Trigueros and C.-J

    F.B. Trigueros and C.-J. Lin,Krylov complexity of many-body localization: Operator localization in Krylov basis, SciPost Phys. 13 (2022) 037 [2112.04722]

  5. [5]

    Rabinovici, A

    E. Rabinovici, A. Sánchez-Garrido, R. Shir and J. Sonner,Krylov localization and suppression of complexity, JHEP 03 (2022) 211 [2112.12128]

  6. [6]

    Rabinovici, A

    E. Rabinovici, A. Sánchez-Garrido, R. Shir and J. Sonner,Krylov complexity from integrability to chaos, JHEP 07 (2022) 151 [2207.07701]

  7. [7]

    Craps, O

    B. Craps, O. Evnin and G. Pascuzzi,Multiseed Krylov complexity, 2409.15666

  8. [8]

    Dyson,Statistical Theory of the Energy Levels of Complex Systems

    F.J. Dyson,Statistical Theory of the Energy Levels of Complex Systems. II, Journal of Mathematical Physics 3 (1962) 157

Show all 25 references
  1. [9]

    Gutzwiller,Periodic orbits and classical quantization conditions, J

    M.C. Gutzwiller,Periodic orbits and classical quantization conditions, J. Math. Phys.12 (1971) 343

  2. [10]

    Berry and M

    M.V. Berry and M. Tabor,Level Clustering in the Regular Spectrum, Proceedings of the Royal Society of London Series A356 (1977) 375

  3. [11]

    Bohigas, M.J

    O. Bohigas, M.J. Giannoni and C. Schmit,Characterization of chaotic quantum spectra and universality of level fluctuation laws, Phys. Rev. Lett.52 (1984) 1

  4. [12]

    Blumel and U

    R. Blumel and U. Smilansky,Random-matrix description of chaotic scattering: Semiclassical approach, Phys. Rev. Lett.64 (1990) 241

  5. [13]

    Hashimoto, K

    K. Hashimoto, K. Murata, N. Tanahashi and R. Watanabe,Krylov complexity and chaos in quantum mechanics, JHEP 11 (2023) 040 [2305.16669]

  6. [14]

    Berry,Quantizing a classically ergodic system: Sinai’s billiard and the kkr method, Annals of Physics 131 (1981) 163

    M. Berry,Quantizing a classically ergodic system: Sinai’s billiard and the kkr method, Annals of Physics 131 (1981) 163

  7. [15]

    Benettin and J.-M

    G. Benettin and J.-M. Strelcyn,Numerical experiments on the free motion of a point mass moving in a plane convex region: Stochastic transition and entropy, Physical review A17 (1978) 773

  8. [16]

    McDonald and A.N

    S.W. McDonald and A.N. Kaufman,Spectrum and Eigenfunctions for a Hamiltonian with Stochastic Trajectories, Phys. Rev. Lett.42 (1979) 1189

  9. [17]

    Casati, F

    G. Casati, F. Valz-Gris and I. Guarnieri,On the connection between quantization of nonintegrable systems and statistical theory of spectra, Lett. Nuovo Cim.28 (1980) 279

  10. [18]

    Weinmann, Müller-Groeling, Pichard and Frahm,h/2e oscillations for correlated electron pairs in disordered mesoscopic rings., Physical review letters75 8 (1995) 1598

  11. [19]

    Nandy, A.S

    P. Nandy, A.S. Matsoukas-Roubeas, P. Martínez-Azcona, A. Dymarsky and A. del Campo, Quantum Dynamics in Krylov Space: Methods and Applications, 2405.09628

  12. [20]

    Dymarsky and A

    A. Dymarsky and A. Gorsky,Quantum chaos as delocalization in Krylov space, Phys. Rev. B 102 (2020) 085137 [1912.12227]. – 32 –

  13. [21]

    Fleishman and D

    L. Fleishman and D. Licciardello,Fluctuations and localization in one dimension, Journal of Physics C: Solid State Physics10 (1977) L125

  14. [22]

    Eynard, T

    B. Eynard, T. Kimura and S. Ribault,Random matrices, 1510.04430

  15. [23]

    Wishart,The generalised product moment distribution in samples from a normal multivariate population, Biometrika (1928) 32

    J. Wishart,The generalised product moment distribution in samples from a normal multivariate population, Biometrika (1928) 32

  16. [24]

    Mehta,Random Matrices, Academic Press (1991)

    M. Mehta,Random Matrices, Academic Press (1991)

  17. [25]

    Haake,Quantum signatures of chaos, Springer (1991)

    F. Haake,Quantum signatures of chaos, Springer (1991). – 33 –

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.