pith. machine review for the scientific record. sign in

arxiv: 2603.25394 · v1 · submitted 2026-03-26 · 🪐 quant-ph

Recognition: 2 theorem links

· Lean Theorem

Quantum Finite Temperature Lanczos Method

Gian Gentinetta , Friederike Metz , William Kirby , Giuseppe Carleo
Authors on Pith no claims yet

Pith reviewed 2026-05-15 06:58 UTC · model grok-4.3

classification 🪐 quant-ph
keywords quantum simulationthermal expectation valuesLanczos methodKrylov subspacetrace estimationIsing modelfinite temperature
0
0 comments X

The pith

The Quantum Finite Temperature Lanczos Method computes thermal expectation values on quantum computers without classical exponential scaling.

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

The paper introduces the Quantum Finite Temperature Lanczos Method (QFTLM) to calculate thermal expectation values in quantum many-body systems. It adapts the finite-temperature Lanczos method for quantum hardware by integrating real-time quantum Krylov methods and efficient typical state preparation for trace estimation. This approach sidesteps the exponential scaling problem that limits classical exact simulations. Tests on the transverse-field Ising model confirm it reproduces thermal observables across temperatures, highlighting the need for regularization to manage errors on noisy devices.

Core claim

QFTLM extends the finite-temperature Lanczos method to quantum computers by combining real-time quantum Krylov methods with efficient preparation of typical states for trace estimation. This enables computation of thermal expectation values while avoiding exponential scaling, as shown by numerical experiments on the transverse-field Ising model that reproduce thermal observables over a wide temperature range, with analysis showing the importance of Krylov dimension, trace-estimator states, and regularization for noisy settings.

What carries the argument

The Quantum Finite Temperature Lanczos Method (QFTLM) that combines real-time quantum Krylov methods with typical state preparation to perform trace estimation for thermal averages.

If this is right

  • Thermal expectation values become accessible for quantum systems too large for classical exact methods.
  • Real-time evolution on quantum hardware replaces classical matrix operations in the Lanczos procedure.
  • Finite Krylov dimensions and modest numbers of trace estimators suffice for accurate results when regularized properly.
  • Robustness on noisy hardware requires suitable regularization to control Trotter and sampling errors.

Where Pith is reading between the lines

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

  • QFTLM may apply to studying phase transitions at finite temperature in models beyond the Ising chain.
  • Combining this with error correction could scale to even larger systems on future quantum devices.
  • Similar Krylov-based approaches might adapt for other quantum statistical mechanics calculations like dynamical correlations.

Load-bearing premise

Suitable regularization together with finite Krylov dimension and modest trace-estimator states can keep Trotter and sampling errors under control on noisy quantum hardware for system sizes beyond small models.

What would settle it

Implementation on actual quantum hardware for a moderately sized system where classical simulation is feasible, checking if computed thermal observables match exact results within predicted error bounds.

Figures

Figures reproduced from arXiv: 2603.25394 by Friederike Metz, Gian Gentinetta, Giuseppe Carleo, William Kirby.

Figure 1
Figure 1. Figure 1: FIG. 1. Thermal expectation values of the energy (a) and [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. Propagation of Trotter error through the QFTLM protocol. In panel (a), we plot the relative error of the thermal [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3. Scaling of the QFTLM error with system size [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4. Effect of noise on the error of thermal energies obtained through QFTLM. Gaussian noise with varying standard [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: FIG. 5. Importance of appropriate regularization for noisy [PITH_FULL_IMAGE:figures/full_fig_p006_5.png] view at source ↗
read the original abstract

The computation of thermal properties of quantum many-body systems is a central challenge in our understanding of quantum mechanics. We introduce the Quantum Finite Temperature Lanczos Method (QFTLM), which extends the finite-temperature Lanczos method to quantum computers by combining real-time quantum Krylov methods with efficient preparation of typical states for trace estimation. This approach enables the computation of thermal expectation values while avoiding the exponential scaling inherent to classical exact simulation techniques. Numerical experiments on the transverse-field Ising model show that QFTLM can reproduce thermal observables over a wide temperature range. We further analyze the influence of Krylov dimension, number of trace-estimator states, and Trotter error, and show that suitable regularization is essential for robustness in noisy settings. These results establish QFTLM as a promising framework for finite-temperature quantum simulation.

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 / 1 minor

Summary. The paper introduces the Quantum Finite Temperature Lanczos Method (QFTLM), which extends the classical finite-temperature Lanczos approach to quantum computers by combining real-time quantum Krylov subspace methods with efficient preparation of typical states for trace estimation. This enables computation of thermal expectation values while sidestepping the exponential cost of classical exact diagonalization. Numerical experiments on the transverse-field Ising model are reported to reproduce thermal observables over a wide temperature range, with additional analysis of the effects of Krylov dimension, number of trace-estimator states, Trotter error, and regularization for noisy hardware robustness.

Significance. If the error-control assumptions hold, QFTLM would offer a scalable route to finite-temperature observables on quantum hardware for system sizes inaccessible to exact classical methods. The explicit treatment of regularization for noise robustness and the parameter choices (Krylov dimension, trace states) are strengths that could make the approach practically relevant for near-term devices.

major comments (2)
  1. [Numerical experiments] Numerical experiments section: the reported reproduction of thermal observables on the transverse-field Ising model is described only qualitatively, with no quantitative error bars, convergence plots versus Krylov dimension K or trace-estimator count M, or tabulated deviations from exact results; without these data the accuracy claim over a wide temperature range cannot be rigorously assessed.
  2. [Scaling and noise analysis] Scaling and noise analysis: the central claim that QFTLM remains accurate for system sizes N where classical exact diagonalization is intractable rests on the assumption that modest fixed K, M, and Trotter steps suffice; however, no explicit scaling data or noise-model simulations are provided for N>12, where circuit depth and accumulated errors grow, leaving the extrapolation untested.
minor comments (1)
  1. [Abstract] The abstract states that regularization is 'essential for robustness' but the main text does not define the regularization operator or its strength parameter explicitly in terms of the Krylov matrix.

Simulated Author's Rebuttal

2 responses · 1 unresolved

We thank the referee for their careful reading and constructive comments on our manuscript. We address each major comment below and will revise the manuscript accordingly.

read point-by-point responses

  1. Referee: Numerical experiments section: the reported reproduction of thermal observables on the transverse-field Ising model is described only qualitatively, with no quantitative error bars, convergence plots versus Krylov dimension K or trace-estimator count M, or tabulated deviations from exact results; without these data the accuracy claim over a wide temperature range cannot be rigorously assessed.

    Authors: We agree that quantitative metrics would strengthen the presentation. The current figures show visual agreement, but the revised manuscript will include error bars on all thermal observable plots, convergence curves versus K and M, and a table of absolute deviations from exact results at representative temperatures. These additions will be incorporated in the next version. revision: yes

  2. Referee: Scaling and noise analysis: the central claim that QFTLM remains accurate for system sizes N where classical exact diagonalization is intractable rests on the assumption that modest fixed K, M, and Trotter steps suffice; however, no explicit scaling data or noise-model simulations are provided for N>12, where circuit depth and accumulated errors grow, leaving the extrapolation untested.

    Authors: We acknowledge that direct numerical evidence for N>12 is absent. Classical simulation limits prevent exact comparisons beyond N=12, so we will add a theoretical scaling analysis showing that cost remains polynomial in N for fixed K and M, plus noise-model simulations on the available system sizes to demonstrate robustness. This provides supporting evidence while noting the inherent verification limits. revision: partial

standing simulated objections not resolved
  • Explicit numerical data or exact comparisons for N>12 cannot be provided, as classical exact diagonalization is intractable for those sizes.

Circularity Check

0 steps flagged

QFTLM defined via independent user parameters with no self-referential reduction

full rationale

The method is introduced by extending classical finite-temperature Lanczos via real-time quantum Krylov subspaces and trace estimation over typical states. All load-bearing quantities (Krylov dimension, number of trace-estimator states, Trotter steps, regularization strength) are explicitly user-chosen inputs rather than quantities fitted to the target thermal observable. Numerical experiments on the transverse-field Ising model serve as external validation; no equation equates a derived prediction back to a fitted parameter by construction, and no central claim rests on a self-citation chain that itself lacks independent support. This yields only a minor self-citation score consistent with normal scholarly practice.

Axiom & Free-Parameter Ledger

3 free parameters · 2 axioms · 0 invented entities

The central claim rests on standard quantum mechanics and the existence of efficient typical-state preparation circuits; no new particles or forces are postulated. Hyperparameters such as Krylov dimension and regularization strength are chosen by the user rather than fitted to the target data.

free parameters (3)
  • Krylov dimension
    Controls the size of the subspace used for real-time evolution; chosen by the user to balance accuracy and cost.
  • Number of trace-estimator states
    Determines the number of typical states sampled for the trace; chosen by the user.
  • Regularization strength
    Added to stabilize the method in the presence of Trotter and hardware noise; chosen by the user.
axioms (2)
  • domain assumption Standard quantum mechanics and the ability to prepare typical states for trace estimation
    Invoked in the description of the trace-estimation step.
  • domain assumption Real-time quantum Krylov methods can be implemented with controllable Trotter error
    Underlying the real-time evolution component.

pith-pipeline@v0.9.0 · 5429 in / 1382 out tokens · 35710 ms · 2026-05-15T06:58:43.894639+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.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Finite-temperature quantum Krylov method from real-time overlaps

    quant-ph 2026-04 unverdicted novelty 6.0

    Real-time overlap sequences g_n enable extraction of specific heat, susceptibility, and entropy over a broad temperature range for quantum systems like the Heisenberg chain without target-temperature state preparation.

Reference graph

Works this paper leans on

75 extracted references · 75 canonical work pages · cited by 1 Pith paper · 1 internal anchor

  1. [1]

    N. D. Mermin, Thermal Properties of the Inhomogeneous Electron Gas, Physical Review137, A1441 (1965)

    work page 1965

  2. [2]

    Georges, G

    A. Georges, G. Kotliar, W. Krauth, and M. J. Rozen- berg, Dynamical mean-field theory of strongly correlated fermion systems and the limit of infinite dimensions, Re- views of Modern Physics68, 13 (1996)

    work page 1996

  3. [3]

    A. F. White and G. Kin-Lic Chan, Finite-temperature coupled cluster: Efficient implementation and applica- tion to prototypical systems, The Journal of Chemical Physics152, 224104 (2020)

    work page 2020

  4. [4]

    Harsha, T

    G. Harsha, T. M. Henderson, and G. E. Scuseria, Ther- mofield theory for finite-temperature quantum chemistry, The Journal of Chemical Physics150, 154109 (2019)

    work page 2019

  5. [5]

    C. Sun, U. Ray, Z.-H. Cui, M. Stoudenmire, M. Fer- rero, and G. K.-L. Chan, Finite-temperature density ma- trix embedding theory, Physical Review B101, 075131 (2020)

    work page 2020

  6. [6]

    Sinha, M

    A. Sinha, M. M. Rams, and J. Dziarmaga, Efficient repre- sentation of minimally entangled typical thermal states in two dimensions via projected entangled pair states, Physical Review B109, 045136 (2024)

    work page 2024

  7. [7]

    Jakliˇ c and P

    J. Jakliˇ c and P. Prelovˇ sek, Lanczos method for the calcu- lation of finite-temperature quantities in correlated sys- tems, Physical Review B49, 5065 (1994)

    work page 1994

  8. [8]

    G. H. Golub and G. Meurant,Matrices, Moments and Quadrature with Applications, Princeton Series in Ap- plied Mathematics (Princeton University Press, 2010)

    work page 2010

  9. [9]

    Avron and S

    H. Avron and S. Toledo, Randomized algorithms for esti- mating the trace of an implicit symmetric positive semi- definite matrix, J. ACM58, 10.1145/1944345.1944349 (2011)

    work page doi:10.1145/1944345.1944349 2011

  10. [10]

    G. H. Golub and C. F. Van Loan,Matrix Computations - 4th Edition(Johns Hopkins University Press, Philadel- phia, PA, 2013)

    work page 2013

  11. [11]

    Roosta-Khorasani and U

    F. Roosta-Khorasani and U. Ascher, Improved bounds on sample size for implicit matrix trace estimators, Founda- tions of Computational Mathematics15, 1187 (2015)

    work page 2015

  12. [12]

    Ubaru, J

    S. Ubaru, J. Chen, and Y. Saad, Fast estimation of tr(f(A)) via stochastic Lanczos quadrature, SIAM Jour- nal on Matrix Analysis and Applications38, 1075 (2017)

    work page 2017

  13. [13]

    Martinsson and J

    P.-G. Martinsson and J. A. Tropp, Randomized numer- ical linear algebra: Foundations and algorithms, Acta Numerica29, 403 (2020)

    work page 2020

  14. [14]

    Hutchinson, A stochastic estimator of the trace of the influence matrix for Laplacian smoothing splines, Com- munication in Statistics- Simulation and Computation 18, 1059 (1989)

    M. Hutchinson, A stochastic estimator of the trace of the influence matrix for Laplacian smoothing splines, Com- munication in Statistics- Simulation and Computation 18, 1059 (1989)

    work page 1989

  15. [15]

    R. P. Feynman, Simulating physics with computers, International Journal of Theoretical Physics21, 467 (1982)

    work page 1982

  16. [16]

    Kandala, A

    A. Kandala, A. Mezzacapo, K. Temme, M. Takita, M. Brink, J. M. Chow, and J. M. Gambetta, Hardware- efficient variational quantum eigensolver for small molecules and quantum magnets, Nature549, 242 (2017)

    work page 2017

  17. [17]

    Chiesa, F

    A. Chiesa, F. Tacchino, M. Grossi, P. Santini, I. Tav- ernelli, D. Gerace, and S. Carretta, Quantum hardware simulating four-dimensional inelastic neutron scattering, Nature Physics15, 455 (2019)

    work page 2019

  18. [18]

    Aruteet al., Hartree-fock on a superconducting qubit quantum computer, Science369, 1084 (2020)

    F. Aruteet al., Hartree-fock on a superconducting qubit quantum computer, Science369, 1084 (2020)

    work page 2020

  19. [19]

    Aruteet al., Observation of separated dynamics of charge and spin in the fermi-hubbard model (2020)

    F. Aruteet al., Observation of separated dynamics of charge and spin in the fermi-hubbard model (2020)

    work page 2020

  20. [20]

    Neillet al., Accurately computing the electronic prop- erties of a quantum ring, Nature594, 508 (2021)

    C. Neillet al., Accurately computing the electronic prop- erties of a quantum ring, Nature594, 508 (2021)

    work page 2021

  21. [21]

    J. R. McClean, M. E. Kimchi-Schwartz, J. Carter, and W. A. de Jong, Hybrid quantum-classical hierarchy for mitigation of decoherence and determination of excited states, Phys. Rev. A95, 042308 (2017)

    work page 2017

  22. [22]

    J. I. Colless, V. V. Ramasesh, D. Dahlen, M. S. Blok, M. E. Kimchi-Schwartz, J. R. McClean, J. Carter, W. A. de Jong, and I. Siddiqi, Computation of molecular spec- tra on a quantum processor with an error-resilient algo- rithm, Phys. Rev. X8, 011021 (2018)

    work page 2018

  23. [23]

    R. M. Parrish and P. L. McMahon, Quantum filter diagonalization: Quantum eigendecomposition without full quantum phase estimation (2019), arXiv:1909.08925 [quant-ph]

    work page arXiv 2019

  24. [24]

    Motta, C

    M. Motta, C. Sun, A. T. K. Tan, M. J. O’Rourke, E. Ye, A. J. Minnich, F. G. S. L. Brand˜ ao, and G. K.-L. Chan, Determining eigenstates and thermal states on a quan- tum computer using quantum imaginary time evolution, Nature Physics16, 205 (2020)

    work page 2020

  25. [25]

    Takeshita, N

    T. Takeshita, N. C. Rubin, Z. Jiang, E. Lee, R. Babbush, and J. R. McClean, Increasing the representation accu- racy of quantum simulations of chemistry without extra quantum resources, Phys. Rev. X10, 011004 (2020)

    work page 2020

  26. [26]

    W. J. Huggins, J. Lee, U. Baek, B. O’Gorman, and K. B. Whaley, A non-orthogonal variational quantum eigen- solver, New Journal of Physics22, 073009 (2020)

    work page 2020

  27. [27]

    N. H. Stair, R. Huang, and F. A. Evangelista, A multiref- erence quantum Krylov algorithm for strongly correlated 8 electrons,Journal of Chemical Theory and Computation, Journal of Chemical Theory and Computation16, 2236 (2020)

    work page 2020

  28. [28]

    Urbanek, D

    M. Urbanek, D. Camps, R. Van Beeumen, and W. A. de Jong, Chemistry on quantum computers with virtual quantum subspace expansion, Journal of Chemical The- ory and Computation16, 5425 (2020)

    work page 2020

  29. [29]

    Kyriienko, Quantum inverse iteration algorithm for programmable quantum simulators, npj Quantum Infor- mation6, 7 (2020)

    O. Kyriienko, Quantum inverse iteration algorithm for programmable quantum simulators, npj Quantum Infor- mation6, 7 (2020)

    work page 2020

  30. [30]

    J. Cohn, M. Motta, and R. M. Parrish, Quantum filter di- agonalization with compressed double-factorized Hamil- tonians, PRX Quantum2, 040352 (2021)

    work page 2021

  31. [31]

    Yoshioka, H

    N. Yoshioka, H. Hakoshima, Y. Matsuzaki, Y. Tokunaga, Y. Suzuki, and S. Endo, Generalized quantum subspace expansion, Phys. Rev. Lett.129, 020502 (2022)

    work page 2022

  32. [32]

    E. N. Epperly, L. Lin, and Y. Nakatsukasa, A theory of quantum subspace diagonalization, SIAM Journal on Matrix Analysis and Applications43, 1263 (2022)

    work page 2022

  33. [33]

    Seki and S

    K. Seki and S. Yunoki, Quantum power method by a superposition of time-evolved states, PRX Quantum2, 010333 (2021)

    work page 2021

  34. [34]

    T. A. Bespalova and O. Kyriienko, Hamiltonian operator approximation for energy measurement and ground-state preparation, PRX Quantum2, 030318 (2021)

    work page 2021

  35. [35]

    T. E. Baker, Lanczos recursion on a quantum computer for the Green’s function and ground state, Phys. Rev. A 103, 032404 (2021)

    work page 2021

  36. [36]

    T. E. Baker, Block Lanczos method for excited states on a quantum computer, Phys. Rev. A110, 012420 (2024)

    work page 2024

  37. [37]

    C. L. Cortes and S. K. Gray, Quantum Krylov subspace algorithms for ground- and excited-state energy estima- tion, Phys. Rev. A105, 022417 (2022)

    work page 2022

  38. [38]

    Klymko, C

    K. Klymko, C. Mejuto-Zaera, S. J. Cotton, F. Wudarski, M. Urbanek, D. Hait, M. Head-Gordon, K. B. Whaley, J. Moussa, N. Wiebe, W. A. de Jong, and N. M. Tubman, Real-time evolution for ultracompact Hamiltonian eigen- states on quantum hardware, PRX Quantum3, 020323 (2022)

    work page 2022

  39. [39]

    Jamet, A

    F. Jamet, A. Agarwal, and I. Rungger, Quantum sub- space expansion algorithm for green’s functions (2022), arXiv:2205.00094 [quant-ph]

    work page arXiv 2022

  40. [40]

    U. Baek, D. Hait, J. Shee, O. Leimkuhler, W. J. Hug- gins, T. F. Stetina, M. Head-Gordon, and K. B. Whaley, Say no to optimization: A nonorthogonal quantum eigen- solver, PRX Quantum4, 030307 (2023)

    work page 2023

  41. [41]

    N. V. Tkachenko, L. Cincio, A. I. Boldyrev, S. Tretiak, P. A. Dub, and Y. Zhang, Quantum Davidson algorithm for excited states, Quantum Science and Technology9, 035012 (2024)

    work page 2024

  42. [42]

    G. Lee, D. Lee, and J. Huh, Sampling Error Analysis in Quantum Krylov Subspace Diagonalization, Quantum8, 1477 (2024)

    work page 2024

  43. [43]

    Zhang, A

    Z. Zhang, A. Wang, X. Xu, and Y. Li, Measurement- efficient quantum Krylov subspace diagonalisation, Quantum8, 1438 (2024)

    work page 2024

  44. [44]

    Kirby, M

    W. Kirby, M. Motta, and A. Mezzacapo, Exact and effi- cient Lanczos method on a quantum computer, Quantum 7, 1018 (2023)

    work page 2023

  45. [45]

    Y. Shen, K. Klymko, J. Sud, D. B. Williams-Young, W. A. d. Jong, and N. M. Tubman, Real-Time Krylov Theory for Quantum Computing Algorithms, Quantum 7, 1066 (2023)

    work page 2023

  46. [46]

    B. Yang, N. Yoshioka, H. Harada, S. Hakkaku, Y. Toku- naga, H. Hakoshima, K. Yamamoto, and S. Endo, Resource-efficient generalized quantum subspace expan- sion, Phys. Rev. Appl.23, 054021 (2025)

    work page 2025

  47. [47]

    R. Yang, T. Wang, B.-N. Lu, Y. Li, and X. Xu, Shadow- based quantum subspace algorithm for the nuclear shell model, Phys. Rev. A111, 012620 (2025)

    work page 2025

  48. [48]

    Ohkura, S

    Y. Ohkura, S. Endo, T. Satoh, R. V. Meter, and N. Yosh- ioka, Leveraging hardware-control imperfections for er- ror mitigation via generalized quantum subspace (2023), arXiv:2303.07660 [quant-ph]

    work page arXiv 2023

  49. [49]

    Motta, W

    M. Motta, W. Kirby, I. Liepuoniute, K. J. Sung, J. Cohn, A. Mezzacapo, K. Klymko, N. Nguyen, N. Yoshioka, and J. E. Rice, Subspace methods for electronic structure sim- ulations on quantum computers, Electronic Structure6, 013001 (2024)

    work page 2024

  50. [50]

    L. W. Anderson, M. Kiffner, T. O’Leary, J. Crain, and D. Jaksch, Solving lattice gauge theories using the quan- tum Krylov algorithm and qubitization, Quantum9, 1669 (2025)

    work page 2025

  51. [51]

    Kirby, Analysis of quantum Krylov algorithms with errors, Quantum8, 1457 (2024)

    W. Kirby, Analysis of quantum Krylov algorithms with errors, Quantum8, 1457 (2024)

    work page 2024

  52. [52]

    Yoshioka, M

    N. Yoshioka, M. Amico, W. Kirby, P. Jurcevic, A. Dutt, B. Fuller, S. Garion, H. Haas, I. Hamamura, A. Ivrii, R. Majumdar, Z. Minev, M. Motta, B. Pokharel, P. Rivero, K. Sharma, C. J. Wood, A. Javadi-Abhari, and A. Mezzacapo, Krylov diagonalization of large many- body Hamiltonians on a quantum processor, Nature Communications16, 5014 (2025)

    work page 2025

  53. [53]

    Byrne, W

    A. Byrne, W. Kirby, K. M. Soodhalter, and S. Zhuk, The quantum super-krylov method (2025), arXiv:2412.17289 [quant-ph]

    work page arXiv 2025

  54. [54]

    J. Yu, J. R. Moreno, J. T. Iosue, L. Bertels, D. Claudino, B. Fuller, P. Groszkowski, T. S. Humble, P. Jurce- vic, W. Kirby, T. A. Maier, M. Motta, B. Pokharel, A. Seif, A. Shehata, K. J. Sung, M. C. Tran, V. Tripathi, A. Mezzacapo, and K. Sharma, Quantum-centric algo- rithm for sample-based krylov diagonalization (2025), arXiv:2501.09702 [quant-ph]

    work page arXiv 2025

  55. [55]

    & Motta, M

    S. Piccinelli, A. Baiardi, S. Barison, M. Rossmannek, A. C. Vazquez, F. Tacchino, S. Mensa, E. Altamura, A. Alavi, M. Motta, J. Robledo-Moreno, W. Kirby, K. Sharma, A. Mezzacapo, and I. Tavernelli, Quan- tum chemistry with provable convergence via randomized sample-based krylov quantum diagonalization (2026), arXiv:2508.02578 [quant-ph]

    work page arXiv 2026

  56. [56]

    Kirby, Y

    W. Kirby, Y. Shen, D. Camps, A. Chowdhury, K. Klymko, and R. V. Beeumen, Quantum krylov al- gorithm for szeg¨ o quadrature (2025), arXiv:2509.19195 [quant-ph]

    work page arXiv 2025

  57. [57]

    C. Lanczos, An iteration method for the solution of the eigenvalue problem of linear differential and integral op- erators, Journal of Research of the National Bureau of Standards45, No. 4 (1950)

    work page 1950

  58. [58]

    Iitaka and T

    T. Iitaka and T. Ebisuzaki, Random phase vector for cal- culating the trace of a large matrix, Phys. Rev. E69, 057701 (2004)

    work page 2004

  59. [59]

    Schnack, J

    J. Schnack, J. Richter, and R. Steinigeweg, Accuracy of the finite-temperature Lanczos method compared to sim- ple typicality-based estimates, Physical Review Research 2, 013186 (2020), arXiv:1911.08838 [cond-mat]

    work page arXiv 2020

  60. [60]

    Schnack, J

    J. Schnack, J. Schulenburg, and J. Richter, Magnetism of the$N=42$kagome lattice antiferromagnet, Physical Review B98, 094423 (2018). 9

    work page 2018

  61. [61]

    Y. Shen, K. Klymko, E. Rabani, N. M. Tubman, D. Camps, R. V. Beeumen, and M. Lindsey, Simple Diag- onal State Designs with Reconfigurable Real-Time Cir- cuits (2025), arXiv:2401.04176 [quant-ph]

    work page arXiv 2025

  62. [62]

    Schuster, J

    T. Schuster, J. Haferkamp, and H.-Y. Huang, Random unitaries in extremely low depth, Science389, 92 (2025), https://www.science.org/doi/pdf/10.1126/science.adv8590

    work page doi:10.1126/science.adv8590 2025

  63. [63]

    The Complexity of Quantum States and Transformations: From Quantum Money to Black Holes

    S. Aaronson, The complexity of quantum states and transformations: From quantum money to black holes (2016), arXiv:1607.05256 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2016

  64. [64]

    Hayden, D

    P. Hayden, D. Leung, P. W. Shor, and A. Winter, Ran- domizing Quantum States: Constructions and Applica- tions, Communications in Mathematical Physics250, 371 (2004)

    work page 2004

  65. [65]

    Dankert, R

    C. Dankert, R. Cleve, J. Emerson, and E. Livine, Ex- act and approximate unitary 2-designs and their applica- tion to fidelity estimation, Physical Review A80, 012304 (2009)

    work page 2009

  66. [66]

    Gross, K

    D. Gross, K. Audenaert, and J. Eisert, Evenly distributed unitaries: On the structure of unitary designs, Journal of Mathematical Physics48, 10.1063/1.2716992 (2007)

    work page doi:10.1063/1.2716992 2007

  67. [67]

    A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum Al- gorithm for Linear Systems of Equations, Physical Re- view Letters103, 150502 (2009)

    work page 2009

  68. [68]

    G. H. Low and I. L. Chuang, Hamiltonian Simulation by Qubitization, Quantum3, 163 (2019)

    work page 2019

  69. [69]

    Cleve, A

    R. Cleve, A. Ekert, C. Macchiavello, and M. Mosca, Quantum algorithms revisited, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences454, 339 (1998)

    work page 1998

  70. [70]

    Aharonov, V

    D. Aharonov, V. Jones, and Z. Landau, A polynomial quantum algorithm for approximating the jones polyno- mial, inProceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing(Association for Computing Machinery, New York, NY, USA, 2006) pp. 427–436

    work page 2006

  71. [71]

    L¨ owdin, On the Nonorthogonality Problem, Ad- vances in Quantum Chemistry5, 185 (1970)

    P.-O. L¨ owdin, On the Nonorthogonality Problem, Ad- vances in Quantum Chemistry5, 185 (1970)

    work page 1970

  72. [72]

    Hatano and M

    N. Hatano and M. Suzuki, Finding exponential prod- uct formulas of higher orders, inQuantum Annealing and Other Optimization Methods, edited by A. Das and B. K. Chakrabarti (Springer Berlin Heidelberg, Berlin, Heidelberg, 2005) pp. 37–68

    work page 2005

  73. [73]

    Lloyd, Universal quantum simulators, Science273, 1073 (1996)

    S. Lloyd, Universal quantum simulators, Science273, 1073 (1996)

    work page 1996

  74. [74]

    A. M. Childs, Y. Su, M. C. Tran, N. Wiebe, and S. Zhu, Theory of Trotter Error with Commutator Scaling, Phys- ical Review X11, 011020 (2021)

    work page 2021

  75. [75]

    Gentinetta and F

    G. Gentinetta and F. Metz, Code for the manuscript Quantum Finite Temperature Lanczos Method

    work page