pith. machine review for the scientific record. sign in

arxiv: 2602.19750 · v2 · submitted 2026-02-23 · 🪐 quant-ph · cond-mat.stat-mech· hep-th

Recognition: 2 theorem links

· Lean Theorem

Krylov Distribution and Universal Convergence of Quantum Fisher Information

Authors on Pith no claims yet

Pith reviewed 2026-05-15 20:46 UTC · model grok-4.3

classification 🪐 quant-ph cond-mat.stat-mechhep-th
keywords Quantum Fisher informationKrylov subspaceLiouville superoperatorResolvent momentsUniversal convergenceOrthogonal polynomialsQuantum metrologySpectral geometry
0
0 comments X

The pith

Quantum Fisher information converges either exponentially or algebraically depending on the gap in the Liouville superoperator spectrum.

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

The paper recasts the quantum Fisher information as a resolvent moment of the superoperator K_rho built from a density matrix. It introduces the Krylov distribution to track how that information weight spreads across successive levels in the Krylov basis of operator space. Orthogonal-polynomial techniques then classify the truncation error: when the Liouville spectrum stays away from zero the error drops exponentially, while accumulation of small eigenvalues produces slower algebraic decay governed by Bessel universality. This supplies both a practical truncation criterion for large systems and a direct spectral handle on metrology precision.

Core claim

Expressing QFI as a resolvent moment of the superoperator K_rho allows the associated Krylov distribution to quantify weight across operator levels; orthogonal polynomial theory applied to these moments then proves two universal regimes for the truncation error, exponential decay when the Liouville spectrum is gapped and algebraic decay of hard-edge Bessel type when eigenvalues accumulate near zero.

What carries the argument

The Krylov distribution, which measures how QFI weight is partitioned across Krylov levels and is controlled by the resolvent moments of the Liouville superoperator K_rho.

If this is right

  • Truncation of the Krylov space yields a controlled approximation to QFI whose error is predicted by the spectral gap.
  • Quantum states can be classified by the gap structure of their Liouville spectrum to forecast metrology performance.
  • The framework supplies an efficient numerical route to QFI in high-dimensional systems where full operator diagonalization fails.
  • Krylov dynamics in operator space becomes a practical tool for quantum metrology calculations.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Similar resolvent-moment constructions may apply to other quantities such as entanglement or coherence measures.
  • The Bessel regime suggests connections to random-matrix descriptions of chaotic or disordered quantum systems.
  • Numerical tests on small spin chains could directly measure the predicted crossover between exponential and algebraic convergence.
  • Optimizing probe states to enlarge the Liouville gap could accelerate both computation and sensing precision.

Load-bearing premise

Orthogonal polynomial theory applies directly to the resolvent moments generated by the Liouville superoperator K_rho.

What would settle it

Compute the decay rate of the truncated QFI approximation for a many-body state whose Liouville spectrum is known to have eigenvalues accumulating at zero and check whether the error follows the predicted algebraic Bessel form rather than exponential decay.

Figures

Figures reproduced from arXiv: 2602.19750 by Fatemeh Tarighi Tabesh, Mohammad Javad Vasli, Mohsen Alishahiha.

Figure 1
Figure 1. Figure 1: Lanczos coefficients an (blue) and bn (brown) for the Krylov basis generated by the superoperator Kρ for a random density matrix ρ with L = 5 for which d0 = 499. The diag￾onal coefficients an are typically larger than the off-diagonal coefficients bn, indicating that the effective Krylov chain is dominated by on-site terms rather than hopping amplitudes. To obtain statistically meaningful results for the c… view at source ↗
Figure 2
Figure 2. Figure 2: Average relative truncation error 1 − F(n) /F as a function of Krylov index n, computed for 20 independent random density matrices with L = 5 in the chaotic regime (g = −1.05, h = 0.5). The decay is qualitatively consistent with the power-law behavior predicted for hard-edge spectral measures. The observed decay is qualitatively consistent with the power-law behavior predicted for spectral measures ex￾hibi… view at source ↗
read the original abstract

We develop a spectral-resolvent framework for computing the quantum Fisher information (QFI) using Krylov subspace methods, extending the notion of the Krylov distribution. By expressing the QFI as a resolvent moment of the superoperator $\mathcal{K}_\rho$ associated with a density matrix, the Krylov distribution quantifies how the QFI weight is distributed across Krylov levels in operator space and provides a natural measure for controlling the truncation error in Krylov approximations. Leveraging orthogonal polynomial theory, we identify two universal convergence regimes: exponential decay when the Liouville-space spectrum is gapped away from zero, and algebraic decay governed by hard-edge (Bessel) universality when small eigenvalues accumulate near zero. This framework establishes a direct connection between quantum metrology, spectral geometry, and Krylov dynamics, offering both conceptual insight and practical tools for efficient QFI computation in high-dimensional and many-body systems.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 0 minor

Summary. The paper develops a spectral-resolvent framework for the quantum Fisher information (QFI) by expressing it as a resolvent moment of the superoperator K_ρ. It extends the Krylov distribution to measure QFI weight distribution across Krylov levels in operator space and applies orthogonal polynomial theory to classify convergence into two universal regimes: exponential decay for gapped Liouville-space spectra away from zero, and algebraic decay governed by hard-edge Bessel universality when small eigenvalues accumulate near zero.

Significance. If the claims hold, the work establishes a direct link between quantum metrology, spectral geometry of superoperators, and Krylov dynamics, with potential practical value for efficient QFI computation in high-dimensional many-body systems via controlled truncation. The universal regimes based on spectral properties of K_ρ could provide conceptual insight beyond specific models.

major comments (2)
  1. [Abstract / spectral-resolvent framework] The central claim that orthogonal polynomial theory directly classifies the convergence of the QFI resolvent moment into gapped exponential or hard-edge Bessel algebraic regimes requires K_ρ to be self-adjoint (or at least normal) with respect to the Hilbert-Schmidt inner product on operators, so that the moment sequence arises from a positive measure on the real line and admits the three-term recurrence. The framework description provides no explicit verification that <A, K_ρ B> = <K_ρ A, B> holds for general ρ, nor confirmation of positive-definiteness of the moments; this assumption is load-bearing for the universality statements.
  2. [Abstract] No derivations, error bounds, or numerical checks are supplied for the two convergence regimes or for the identification of the Krylov distribution as a measure of truncation error. Without these, the soundness of the exponential-versus-algebraic classification cannot be assessed beyond the stated claims.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive feedback on our manuscript. The comments highlight important foundational aspects of the spectral-resolvent framework and the need for supporting technical details. We address each major comment below and will revise the manuscript to strengthen the presentation.

read point-by-point responses
  1. Referee: [Abstract / spectral-resolvent framework] The central claim that orthogonal polynomial theory directly classifies the convergence of the QFI resolvent moment into gapped exponential or hard-edge Bessel algebraic regimes requires K_ρ to be self-adjoint (or at least normal) with respect to the Hilbert-Schmidt inner product on operators, so that the moment sequence arises from a positive measure on the real line and admits the three-term recurrence. The framework description provides no explicit verification that <A, K_ρ B> = <K_ρ A, B> holds for general ρ, nor confirmation of positive-definiteness of the moments; this assumption is load-bearing for the universality statements.

    Authors: We agree that self-adjointness of the superoperator K_ρ (with respect to the Hilbert-Schmidt inner product) is a necessary condition for the direct application of orthogonal polynomial theory and the resulting universality classification. In the manuscript, K_ρ is defined via the Liouville superoperator associated with the density matrix ρ, and the framework is developed for states where this property holds (e.g., thermal states and those with finite correlation length). To address the concern explicitly, we will add a dedicated lemma in the revised version proving that ⟨A, K_ρ B⟩_HS = ⟨K_ρ A, B⟩_HS for Hermitian operators A, B, together with a brief discussion confirming positive-definiteness of the moment sequence under the stated spectral assumptions. This will make the load-bearing assumption transparent and delineate the precise domain of validity for the exponential and algebraic regimes. revision: yes

  2. Referee: [Abstract] No derivations, error bounds, or numerical checks are supplied for the two convergence regimes or for the identification of the Krylov distribution as a measure of truncation error. Without these, the soundness of the exponential-versus-algebraic classification cannot be assessed beyond the stated claims.

    Authors: We acknowledge that the current manuscript presents the two universal convergence regimes primarily at the level of the abstract and main claims, without full derivations or quantitative checks in the provided text. The full paper defines the Krylov distribution and links it to truncation error via resolvent moments, but we agree that explicit derivations, error bounds, and numerical validation are needed for a complete assessment. In the revision we will expand the relevant section to include: (i) a derivation of the exponential decay rate from the spectral gap of K_ρ away from zero, (ii) the mapping to hard-edge Bessel universality for the algebraic case drawing on established orthogonal-polynomial asymptotics, (iii) rigorous a-priori error bounds expressed directly in terms of the tail of the Krylov distribution, and (iv) numerical benchmarks on finite spin-chain models that illustrate both regimes and quantify truncation error. These additions will allow readers to evaluate the classification rigorously. revision: yes

Circularity Check

0 steps flagged

No significant circularity; external orthogonal polynomial theory applied to new resolvent representation

full rationale

The paper expresses QFI as a resolvent moment of superoperator K_ρ to define the Krylov distribution, then applies standard orthogonal polynomial theory to classify convergence into gapped exponential or hard-edge Bessel regimes based on the Liouville spectrum. No step reduces by construction to a fitted parameter, self-definition, or load-bearing self-citation chain; the universality statements follow from external moment theory once the resolvent representation is given. The derivation is self-contained against the independent mathematical framework of orthogonal polynomials on the real line, with no renaming of known results or ansatz smuggling visible in the provided chain.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The central claims rest on the applicability of orthogonal polynomial theory to resolvent moments of the superoperator and on the spectral properties of the Liouville operator; no free parameters or invented particles are introduced.

axioms (1)
  • standard math Orthogonal polynomial theory governs the asymptotics of resolvent moments for the superoperator K_ρ
    Invoked to classify exponential versus algebraic convergence regimes
invented entities (1)
  • Krylov distribution no independent evidence
    purpose: Quantifies the distribution of QFI weight across Krylov levels in operator space
    Newly introduced construct that controls truncation error

pith-pipeline@v0.9.0 · 5464 in / 1200 out tokens · 27719 ms · 2026-05-15T20:46:53.663165+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

43 extracted references · 43 canonical work pages · 4 internal anchors

  1. [1]

    Quantum Detection and Estimation Theory,

    C. W. Helstrom, “Quantum Detection and Estimation Theory,” J. Stat. Phys.1, 231–252 (1969)

  2. [2]

    Statistical distance and the geometry of quantum states,

    S. L. Braunstein and C. M. Caves, “Statistical distance and the geometry of quantum states,” Phys. Rev. Lett. 72, 3439–3443 (1994)

  3. [3]

    Quantum estimation for quantum tech- nology,

    M. G. A. Paris, “Quantum estimation for quantum tech- nology,” Int. J. Quant. Inf.7, 125–137 (2009)

  4. [4]

    Multipartite entanglement and high-precision metrology,

    G. T´ oth, “Multipartite entanglement and high-precision metrology,” Phys. Rev. A85, 022322 (2012)

  5. [5]

    Fisher information and multiparticle entanglement,

    P. Hyllus, W. Laskowski, R. Krischek, C. Schwemmer, W. Wieczorek, H. Weinfurter, L. Pezz´ e, and A. Smerzi, “Fisher information and multiparticle entanglement,” Phys. Rev. A85, 022321 (2012)

  6. [6]

    Entanglement, Nonlinear Dy- namics, and the Heisenberg Limit,

    L. Pezz´ e and A. Smerzi, “Entanglement, Nonlinear Dy- namics, and the Heisenberg Limit,” Phys. Rev. Lett.102, 100401 (2009)

  7. [7]

    Mea- suring multipartite entanglement through dynamic sus- ceptibilities,

    P. Hauke, M. Heyl, L. Tagliacozzo, and P. Zoller, “Mea- suring multipartite entanglement through dynamic sus- ceptibilities,” Nat. Phys.12, 778–782 (2016)

  8. [8]

    Quantum Critical Scaling of the Geometric Tensors,

    L. Campos Venuti and P. Zanardi, “Quantum Critical Scaling of the Geometric Tensors,” Phys. Rev. Lett.99, 095701 (2007)

  9. [9]

    Information- Theoretic Differential Geometry of Quantum Phase Transitions,

    P. Zanardi, G. Giorda, and M. Cozzini, “Information- Theoretic Differential Geometry of Quantum Phase Transitions,” Phys. Rev. Lett.99, 100603 (2007)

  10. [10]

    Many-Body Nonlo- cality as a Resource for Quantum-Enhanced Metrology,

    A. Niezgoda and J. Chwede´ nczuk, “Many-Body Nonlo- cality as a Resource for Quantum-Enhanced Metrology,” Phys. Rev. Lett.126, 210506 (2021)

  11. [11]

    From classical to quan- tum information geometry: a guide for physicists,

    J. Lambert and E. S. Sørensen, “From classical to quan- tum information geometry: a guide for physicists,” New J. Phys.25, 081201 (2023)

  12. [12]

    A Universal Operator Growth Hypothesis,

    D. E. Parker, X. Cao, A. Avdoshkin, T. Scaffidi, and E. Altman, “A Universal Operator Growth Hypothesis,” Phys. Rev. X9, 041017 (2019)

  13. [13]

    Krylov localization and suppression of complexity,

    E. Rabinovici, A. S´ anchez-Garrido, R. Shir, and J. Son- ner, “Krylov localization and suppression of complexity,” JHEP03, 211 (2022)

  14. [14]

    Quantum Fisher information matrix and multiparameter estima- tion,

    J. Liu, H. Yuan, X. M. Lu, and X. Wang, “Quantum Fisher information matrix and multiparameter estima- tion,” J. Phys. A: Math. Theor.53, 023001 (2019)

  15. [15]

    Quantum Fisher information and its dynamical nature,

    M. Scandi, P. Abiuso, J. Surace, and D. De Santis, “Quantum Fisher information and its dynamical nature,” Rep. Prog. Phys.88, 076001 (2025)

  16. [16]

    Fisher information and stochastic com- plexity,

    J. J. Rissanen, “Fisher information and stochastic com- plexity,” IEEE Trans. Inf. Theory42, 40 (1996)

  17. [17]

    Natural selection maximizes Fisher infor- mation,

    S. A. Frank, “Natural selection maximizes Fisher infor- mation,” J. Evol. Biol.22, 231 (2009)

  18. [18]

    An iteration method for the solution of the eigenvalue problem of linear differential and integral op- erators,

    C. Lanczos, “An iteration method for the solution of the eigenvalue problem of linear differential and integral op- erators,” J. Res. Natl. Bur. Stand.45, 255–282 (1950)

  19. [19]

    Unitary quantum time evo- lution by iterative Lanczos reduction,

    T. J. Park and J. C. Light, “Unitary quantum time evo- lution by iterative Lanczos reduction,” J. Chem. Phys. 85, 5870–5876 (1986)

  20. [20]

    The recursive solution of the Schr¨ odinger equation,

    R. Haydock, “The recursive solution of the Schr¨ odinger equation,” Comp. Phys. Commun.20, 11–16 (1980)

  21. [21]

    Iterative Methods for Sparse Linear Systems,

    Y. Saad, “Iterative Methods for Sparse Linear Systems,” 2nd ed., SIAM, Philadelphia (2003)

  22. [22]

    The Recursion Method: Application to Many Body Dynamics,

    V. S. Viswanath and G. M¨ uller, “The Recursion Method: Application to Many Body Dynamics,” Lecture Notes in Physics Monographs, Springer (1994). 12

  23. [23]

    Automorphisms of the truth-table degrees are fixed on some cone

    D. Viswanath, “The recursion method and the spectrum of the Schr¨ odinger operator,” arXiv:0805.0005 [math.NA] (2008)

  24. [24]

    Two polynomial methods of calculating functions of symmetric matrices,

    V. L. Druskin and L. A. Knizhnerman, “Two polynomial methods of calculating functions of symmetric matrices,” USSR Comput. Maths. Math. Phys.29, 112–121 (1989)

  25. [25]

    Solution of large scale evolutionary problems using ra- tional Krylov subspaces with optimized shifts,

    V. L. Druskin, L. A. Knizhnerman, and M. Zaslavsky, “Solution of large scale evolutionary problems using ra- tional Krylov subspaces with optimized shifts,” SIAM J. Sci. Comput.31, 3760–3780 (2009)

  26. [26]

    Krylov Shadow To- mography: Efficient Estimation of Quantum Fisher Information,

    D. J. Zhang and D. M. Tong, “Krylov Shadow To- mography: Efficient Estimation of Quantum Fisher Information,” Phys. Rev. Lett.134, 110802 (2025), arXiv:2503.01697 [quant-ph]

  27. [27]

    Quantum dynamics in Krylov space: Methods and applications,

    P. Nandy, A. S. Matsoukas-Roubeas, P. Mart´ ınez- Azcona, A. Dymarsky, and A. del Campo, “Quantum dynamics in Krylov space: Methods and applications,” Phys. Rept.1125, 1–82 (2025), arXiv:2405.09628 [quant- ph]

  28. [28]

    Krylov Complexity,

    E. Rabinovici, A. S´ anchez-Garrido, R. Shir, and J. Son- ner, “Krylov Complexity,” arXiv:2507.06286 [hep-th] (2025)

  29. [29]

    Krylov Distribution,

    M. Alishahiha and M. J. Vasli, “Krylov Distribution,” arXiv:2602.06150 [hep-th] (2026)

  30. [30]

    Orthogonal Polynomials,

    G. Szeg˝ o, “Orthogonal Polynomials,” 4th ed., Amer. Math. Soc., 1975

  31. [31]

    Orthogonal Polynomials: Computation and Approximation,

    W. Gautschi, “Orthogonal Polynomials: Computation and Approximation,” Oxford Univ. Press, 2004

  32. [32]

    Logarithmic Potentials with External Fields,

    E. B. Saff and V. Totik, “Logarithmic Potentials with External Fields,” Springer, 1997

  33. [33]

    A New Approach to Universality Limits involving Orthogonal Polynomials

    D. S. Lubinsky, “A New Approach to Universality Lim- its involving Orthogonal Polynomials,” Ann. Math.170, 915 (2009), arXiv:math/0701307 [math.CA]

  34. [34]

    Orthogonal Polynomials and Random Matri- ces: A Riemann–Hilbert Approach,

    P. Deift, “Orthogonal Polynomials and Random Matri- ces: A Riemann–Hilbert Approach,” Amer. Math. Soc., 1999

  35. [35]

    Emergent random matrix univer- sality in quantum operator dynamics,

    O. Lunt, T. Kriecherbauer, K. T. R. McLaughlin, and C. von Keyserlingk, “Emergent random matrix univer- sality in quantum operator dynamics,” arXiv:2504.18311 [quant-ph] (2025)

  36. [36]

    Strong and weak thermalization of infinite non-integrable quantum systems

    M. C. Ba˜ nuls, J. I. Cirac, and M. B. Hastings, “Strong and Weak Thermalization of Infinite Noninte- grable Quantum Systems,” Phys. Rev. Lett.106, 050405 (2011), arXiv:1007.3957 [quant-ph]

  37. [37]

    Spectral ap- proach to solving three-dimensional Maxwell’s diffusion equations in the time and frequency domains,

    V. L. Druskin and L. A. Knizhnerman, “Spectral ap- proach to solving three-dimensional Maxwell’s diffusion equations in the time and frequency domains,” Radio Sci. 29, 937–953 (1994)

  38. [38]

    P. J. Davis and P. Rabinowitz,Methods of Numerical In- tegration, 2nd ed. (Academic Press, Orlando, FL, 1984)

  39. [39]

    Extended Krylov subspaces: Approximation of the matrix square root and related functions,

    V. L. Druskin and L. A. Knizhnerman, “Extended Krylov subspaces: Approximation of the matrix square root and related functions,” SIAM J. Matrix Anal. Appl.19, 775– 791 (1998)

  40. [40]

    Rational Krylov methods for operator func- tions,

    S. G¨ uttel, “Rational Krylov methods for operator func- tions,” MIMS EPrint 2017.39, Manchester Institute for Mathematical Sciences, The University of Manchester, 2017

  41. [41]

    Error estimates for polynomial Krylov approximations to matrix functions,

    F. Diele, I. Moret, and S. Ragni, “Error estimates for polynomial Krylov approximations to matrix functions,” SIAM J. Matrix Anal. Appl.30, 1546–1565 (2008)

  42. [42]

    Universality limits involv- ing orthogonal polynomials,

    E. Levin and D. S. Lubinsky, “Universality limits involv- ing orthogonal polynomials,” Acta Math.187, 87 (2001)

  43. [43]

    Superiority of Krylov shadow tomography in estimating quantum Fisher information: From bounds to exactness

    Y. H. Wang and D. J. Zhang, “Superiority of Krylov shadow tomography in estimating quantum Fisher infor- mation: From bounds to exactness,” arXiv:2602.17361 [quant-ph] (2026)