- Open Access
Quantum finite-temperature Lanczos method
Phys. Rev. Research 8, 023285 – Published 11 June, 2026
DOI: https://doi.org/10.1103/f3q5-cm1n
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.
Physics Subject Headings (PhySH)
Article Text
References (77)
- N. D. Mermin, Thermal properties of the inhomogeneous electron gas, Phys. Rev. 137, A1441 (1965).
- A. Georges, G. Kotliar, W. Krauth, and M. J. Rozenberg, Dynamical mean-field theory of strongly correlated fermion systems and the limit of infinite dimensions, Rev. Mod. Phys. 68, 13 (1996).
- A. F. White and G. K.-L. Chan, Finite-temperature coupled cluster: Efficient implementation and application to prototypical systems, J. Chem. Phys. 152, 224104 (2020).
- G. Harsha, T. M. Henderson, and G. E. Scuseria, Thermofield theory for finite-temperature quantum chemistry, J. Chem. Phys. 150, 154109 (2019).
- C. Sun, U. Ray, Z.-H. Cui, M. Stoudenmire, M. Ferrero, and G. K.-L. Chan, Finite-temperature density matrix embedding theory, Phys. Rev. B 101, 075131 (2020).
- A. Sinha, M. M. Rams, and J. Dziarmaga, Efficient representation of minimally entangled typical thermal states in two dimensions via projected entangled pair states, Phys. Rev. B 109, 045136 (2024).
- J. Jaklič and P. Prelovšek, Lanczos method for the calculation of finite-temperature quantities in correlated systems, Phys. Rev. B 49, 5065 (1994).
- G. H. Golub and G. Meurant, Matrices, Moments and Quadrature with Applications, Princeton Series in Applied Mathematics (Princeton University Press, Princeton, NJ, 2010).
- H. Avron and S. Toledo, Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix, J. ACM 58, 1 (2011).
- G. H. Golub and C. F. Van Loan, Matrix Computations, 4th ed. (Johns Hopkins University Press, Philadelphia, PA, 2013).
- F. Roosta-Khorasani and U. Ascher, Improved bounds on sample size for implicit matrix trace estimators, Found. Comput. Math. 15, 1187 (2015).
- S. Ubaru, J. Chen, and Y. Saad, Fast estimation of tr((A)) via stochastic Lanczos quadrature, SIAM J. Matrix Anal. Appl. 38, 1075 (2017).
- P.-G. Martinsson and J. A. Tropp, Randomized numerical linear algebra: Foundations and algorithms, Acta Numer. 29, 403 (2020).
- M. Hutchinson, A stochastic estimator of the trace of the influence matrix for Laplacian smoothing splines, Commun. Stat. Simul. Comput. 18, 1059 (1989).
- R. P. Feynman, Simulating physics with computers, Int. J. Theor. Phys. 21, 467 (1982).
- 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, Nature (London) 549, 242 (2017).
- A. Chiesa, F. Tacchino, M. Grossi, P. Santini, I. Tavernelli, D. Gerace, and S. Carretta, Quantum hardware simulating four-dimensional inelastic neutron scattering, Nat. Phys. 15, 455 (2019).
- F. Arute et al., Hartree-Fock on a superconducting qubit quantum computer, Science 369, 1084 (2020).
- F. Arute et al., Observation of separated dynamics of charge and spin in the Fermi-Hubbard model, arXiv:2010.07965.
- C. Neill et al., Accurately computing the electronic properties of a quantum ring, Nature (London) 594, 508 (2021).
- 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. A 95, 042308 (2017).
- 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 spectra on a quantum processor with an error-resilient algorithm, Phys. Rev. X 8, 011021 (2018).
- R. M. Parrish and P. L. McMahon, Quantum filter diagonalization: Quantum eigendecomposition without full quantum phase estimation, arXiv:1909.08925.
- M. Motta, C. Sun, A. T. K. Tan, M. J. O’Rourke, E. Ye, A. J. Minnich, F. G. S. L. Brandão, and G. K.-L. Chan, Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution, Nat. Phys. 16, 205 (2020).
- T. Takeshita, N. C. Rubin, Z. Jiang, E. Lee, R. Babbush, and J. R. McClean, Increasing the representation accuracy of quantum simulations of chemistry without extra quantum resources, Phys. Rev. X 10, 011004 (2020).
- W. J. Huggins, J. Lee, U. Baek, B. O’Gorman, and K. B. Whaley, A non-orthogonal variational quantum eigensolver, New J. Phys. 22, 073009 (2020).
- N. H. Stair, R. Huang, and F. A. Evangelista, A multireference quantum Krylov algorithm for strongly correlated electrons, J. Chem. Theory Comput. 16, 2236 (2020).
- M. Urbanek, D. Camps, R. Van Beeumen, and W. A. de Jong, Chemistry on quantum computers with virtual quantum subspace expansion, J. Chem. Theory Comput. 16, 5425 (2020).
- O. Kyriienko, Quantum inverse iteration algorithm for programmable quantum simulators, npj Quantum Inf. 6, 7 (2020).
- J. Cohn, M. Motta, and R. M. Parrish, Quantum filter diagonalization with compressed double-factorized Hamiltonians, PRX Quantum 2, 040352 (2021).
- N. Yoshioka, H. Hakoshima, Y. Matsuzaki, Y. Tokunaga, Y. Suzuki, and S. Endo, Generalized quantum subspace expansion, Phys. Rev. Lett. 129, 020502 (2022).
- E. N. Epperly, L. Lin, and Y. Nakatsukasa, A theory of quantum subspace diagonalization, SIAM J. Matrix Anal. Appl. 43, 1263 (2022).
- K. Seki and S. Yunoki, Quantum power method by a superposition of time-evolved states, PRX Quantum 2, 010333 (2021).
- T. A. Bespalova and O. Kyriienko, Hamiltonian operator approximation for energy measurement and ground-state preparation, PRX Quantum 2, 030318 (2021).
- T. E. Baker, Lanczos recursion on a quantum computer for the Green's function and ground state, Phys. Rev. A 103, 032404 (2021).
- T. E. Baker, Block Lanczos method for excited states on a quantum computer, Phys. Rev. A 110, 012420 (2024).
- C. L. Cortes and S. K. Gray, Quantum Krylov subspace algorithms for ground- and excited-state energy estimation, Phys. Rev. A 105, 022417 (2022).
- 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 eigenstates on quantum hardware, PRX Quantum 3, 020323 (2022).
- F. Jamet, A. Agarwal, and I. Rungger, Quantum subspace expansion algorithm for Green's functions, arXiv:2205.00094.
- U. Baek, D. Hait, J. Shee, O. Leimkuhler, W. J. Huggins, T. F. Stetina, M. Head-Gordon, and K. B. Whaley, Say no to optimization: A nonorthogonal quantum eigensolver, PRX Quantum 4, 030307 (2023).
- N. V. Tkachenko, L. Cincio, A. I. Boldyrev, S. Tretiak, P. A. Dub, and Y. Zhang, Quantum Davidson algorithm for excited states, Quantum Sci. Technol. 9, 035012 (2024).
- G. Lee, D. Lee, and J. Huh, Sampling error analysis in quantum Krylov subspace diagonalization, Quantum 8, 1477 (2024).
- Z. Zhang, A. Wang, X. Xu, and Y. Li, Measurement-efficient quantum Krylov subspace diagonalisation, Quantum 8, 1438 (2024).
- W. Kirby, M. Motta, and A. Mezzacapo, Exact and efficient Lanczos method on a quantum computer, Quantum 7, 1018 (2023).
- 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).
- B. Yang, N. Yoshioka, H. Harada, S. Hakkaku, Y. Tokunaga, H. Hakoshima, K. Yamamoto, and S. Endo, Resource-efficient generalized quantum subspace expansion, Phys. Rev. Appl. 23, 054021 (2025).
- R. Yang, T. Wang, B.-N. Lu, Y. Li, and X. Xu, Shadow-based quantum subspace algorithm for the nuclear shell model, Phys. Rev. A 111, 012620 (2025).
- Y. Ohkura, S. Endo, T. Satoh, R. V. Meter, and N. Yoshioka, Leveraging hardware-control imperfections for error mitigation via generalized quantum subspace, arXiv:2303.07660.
- 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 simulations on quantum computers, Electron. Struct. 6, 013001 (2024).
- L. W. Anderson, M. Kiffner, T. O'Leary, J. Crain, and D. Jaksch, Solving lattice gauge theories using the quantum Krylov algorithm and qubitization, Quantum 9, 1669 (2025).
- W. Kirby, Analysis of quantum Krylov algorithms with errors, Quantum 8, 1457 (2024).
- 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, Nat. Commun. 16, 5014 (2025).
- A. Byrne, W. Kirby, K. M. Soodhalter, and S. Zhuk, The quantum super-Krylov method, arXiv:2412.17289.
- J. Yu, J. R. Moreno, J. T. Iosue, L. Bertels, D. Claudino, B. Fuller, P. Groszkowski, T. S. Humble, P. Jurcevic, 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 algorithm for sample-based Krylov diagonalization, arXiv:2501.09702.
- 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, Quantum chemistry with provable convergence via randomized sample-based Krylov quantum diagonalization, arXiv:2508.02578.
- W. Kirby, Y. Shen, D. Camps, A. Chowdhury, K. Klymko, and R. V. Beeumen, Quantum Krylov algorithm for Szegö quadrature, arXiv:2509.19195.
- C. Lanczos, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, J. Res. Natl. Bur. Stand. 45, 255 (1950).
- T. Iitaka and T. Ebisuzaki, Random phase vector for calculating the trace of a large matrix, Phys. Rev. E 69, 057701 (2004).
- J. Schnack, J. Richter, and R. Steinigeweg, Accuracy of the finite-temperature Lanczos method compared to simple typicality-based estimates, Phys. Rev. Res. 2, 013186 (2020).
- J. Schnack, J. Schulenburg, and J. Richter, Magnetism of the kagome lattice antiferromagnet, Phys. Rev. B 98, 094423 (2018).
- Y. Shen, K. Klymko, E. Rabani, N. M. Tubman, D. Camps, R. V. Beeumen, and M. Lindsey, Diagonal state designs with reconfigurable real-time circuits, Phys. Rev. Res. 8, 013042 (2026).
- T. Schuster, J. Haferkamp, and H.-Y. Huang, Random unitaries in extremely low depth, Science 389, 92 (2025).
- S. Aaronson, The complexity of quantum states and transformations: From quantum money to black holes, arXiv:1607.05256.
- P. Hayden, D. Leung, P. W. Shor, and A. Winter, Randomizing quantum states: Constructions and applications, Commun. Math. Phys. 250, 371 (2004).
- C. Dankert, R. Cleve, J. Emerson, and E. Livine, Exact and approximate unitary 2-designs and their application to fidelity estimation, Phys. Rev. A 80, 012304 (2009).
- D. Gross, K. Audenaert, and J. Eisert, Evenly distributed unitaries: On the structure of unitary designs, J. Math. Phys. 48, 052104 (2007).
- A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum algorithm for linear systems of equations, Phys. Rev. Lett. 103, 150502 (2009).
- G. H. Low and I. L. Chuang, Hamiltonian simulation by qubitization, Quantum 3, 163 (2019).
- R. Cleve, A. Ekert, C. Macchiavello, and M. Mosca, Quantum algorithms revisited, Proc. R. Soc. London, Ser. A 454, 339 (1998).
- D. Aharonov, V. Jones, and Z. Landau, A polynomial quantum algorithm for approximating the Jones polynomial, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing (ACM Press, New York, NY, 2006), pp. 427–436.
- P.-O. Löwdin, On the nonorthogonality problem, Adv. Quantum Chem. 5, 185 (1970).
- N. Hatano and M. Suzuki, Finding exponential product formulas of higher orders, in Quantum Annealing and Other Optimization Methods, edited by A. Das and B. K. Chakrabarti (Springer, Berlin, 2005), pp. 37–68.
- S. Lloyd, Universal quantum simulators, Science 273, 1073 (1996).
- A. M. Childs, Y. Su, M. C. Tran, N. Wiebe, and S. Zhu, Theory of Trotter error with commutator scaling, Phys. Rev. X 11, 011020 (2021).
- S. R. White, Density matrix formulation for quantum renormalization groups, Phys. Rev. Lett. 69, 2863 (1992).
- U. Schollwöck, The density-matrix renormalization group in the age of matrix product states, Ann. Phys. 326, 96 (2011).
- G. Gentinetta and F. Metz, Data for Manuscript on the Quantum Finite Temperature Lanczos Method (Materials Cloud Archive, 2026), https://github.com/gentinettagian/QuantumFiniteTemperatureLanczos.