Quantum Monte Carlo methods are widely used to solve quantum many-body problems. However, rigorous guarantees for their performance are poorly understood, especially for simulating interacting fermions. In this work, we develop a quantum Monte Carlo algorithm for a broad family of fermionic systems exhibiting Kramers time-reversal symmetry, and prove that their partition functions can be estimated in polynomial time. This family, which contains many important classes of Hubbard-type models, is known to both avoid the sign problem and obey a Lee-Yang zero-freeness theorem. Thus our results suggest that these two properties together may enable efficient classical algorithms for quantum many-body systems more broadly.
Introduction
Simulating quantum many-body systems is at the heart of modern computational physics and chemistry. A powerful tool for this task is the quantum Monte Carlo method, a suite of classical probabilistic algorithms which has enjoyed a long record of empirical success [26, 4, 55]. Despite their widespread adoption, however, rigorous guarantees for such methods are relatively sparse [24, 21, 63 RT25]. Moreover, such analyses are mostly confined to quantum spin models, whereas fermionic systems can provide a richer description of correlated quantum matter [3]. A theoretical understanding for the complexity of fermionic quantum Monte Carlo is therefore largely unexplored, even when the sign problem is absent [43]. Even beyond the scope of quantum Monte Carlo, only a limited number of strongly interacting fermionic systems are known to admit provably efficient classical algorithms for computing equilibrium properties [49 JJP+26, 2, 62].
Understanding the structural properties that enable efficient simulation is central to expanding this frontier. For example, systems free of a sign problem can be treated straightforwardly with quantum Monte Carlo; however, this does not by itself guarantee the efficiency of the approach [30, 44]. On the other hand, recent advances in quantum algorithms [53, 12] have shown that the ground-energy problem can be efficiently solved, using a quantum computer, for systems obeying a Lee-Yang zero-freeness theorem [42, 8, 56]. For spin systems, this class includes (as a strict subset) Hamiltonians for which efficient classical algorithms have also been established, including stoquastic XY models [11 RT25] and, very recently, ferromagnetic Heisenberg models1[22]. Notably, these examples are all stoquastic, suggesting a potential connection between the Lee-Yang property, the sign problem, and efficient classical simulation.
For fermionic systems, a version of the Lee-Yang theorem was recently discovered, covering a wide range of strongly interacting Fermi-Hubbard models [50]. Hubbard models provide a central paradigm for understanding electron correlation in materials, exhibiting rich phase diagrams that encompass Mott metal-insulator transitions, unconventional superconductivity, and more [3]. Analogous to the spin case, this class also includes many Hamiltonians which are sign-problem-free by certain fermionic quantum Monte Carlo representations [43]. However, unlike the situation for spins, the computational efficiency of this intersection is essentially unknown. This motivates us to study this intersection, both because of the importance of the Hubbard models within, and also to further explore this connection between the freeness of partition function zeros and of the sign problem.
We initiate this study here, giving a polynomial-time classical algorithm for computing the partition function of a broad family of Hamiltonians lying in this intersection. Specifically, our algorithmic guarantees apply to fermionic Lee-Yang Hamiltonians obeying Kramers time-reversal symmetry [58].
Theorem (Informal).For any fermionic Hamiltonian H on 2N modes with attractive interactions and Kramers symmetry (Theorem 1), there is a classical randomized algorithm that estimates the partition function Z=Tre−βH to relative error ε in time poly(N,β,1/ε). Consequently, we can efficiently estimate the free energy and the ground energy of H to any 1/poly(N) additive error.
Importantly, there are no restrictions on the strength or extensivity of the fermionic interactions. Canonical examples in this family include [4]:
Attractive Fermi-Hubbard models with real hopping amplitudes on any graph;
Repulsive Fermi-Hubbard models at half filling, with real hopping amplitudes on any bipartite graph (by a staggered particle-hole transformation).
For other notable examples, see [WZ05].
Kramers symmetry is well known to provide a positive-sign expansion of the partition function via the Hubbard-Stratonovich transformation [WZ05], a cornerstone for determinant quantum Monte Carlo [59, 20, 31]. However, our algorithm does not rely on Hubbard-Stratonovich. Instead, it more closely resembles the interaction expansion from continuous-time quantum Monte Carlo [51], although we work in discrete time. Our key insight is the development of a determinantal worm Markov chain, analogous to the worm algorithm for spins [47, 48, 54] and systematically extending beyond ideas proposed previously for fermions [16, 29, 64]. We show that Kramers symmetry preserves sign positivity of the interaction expansion not only in the original configuration space, but also in this expanded worm-configuration space. Then, following recent breakthroughs on the fast mixing of Markov chain over certain log-concave and related measures [6, 22], we prove that Kramers symmetry provides precisely the necessary ingredients to establish polynomial-time convergence of our quantum Monte Carlo algorithm.
Main results
Here, we summarize our main results formally. Consider a fermionic system of an even number 2N of modes, described by the Fock space F=⨁k=02N⋀kC2N. Let a=(a1,…,a2N)T be the vector of fermionic annihilation operators. For a vector v∈C2N, let a(v):=v†a. If v is a unit vector, then a(v) is the annihilation operator of an excitation in that mode v, and n(v):=a(v)†a(v)=a†vv†a is the corresponding number operator.
Kramers symmetry is defined with respect to the notion of antiunitary operators. An operator Θ on a complex inner product space is antiunitary if
Θ(αu+βv)=αˉΘu+βˉΘvand⟨Θu,Θv⟩=⟨v,u⟩(1)
for all vectors u, v and all α, β∈C, where we use αˉ to denote the complex conjugate of α. Formally, we define the attractive Kramers class of interacting fermionic Hamiltonians as follows.
Definition 1 (Attractive Kramers class). A HamiltonianH on a Fock spaceF on 2N modes is in the attractive Kramers class if there exists an antiunitary operatorΘ on C2N with Θ2=−I, a Hermitian matrixh∈C2N×2N with ΘhΘ−1=h, unit vectors v1,…,vr∈C2N, and nonnegative numbers U1,…,Ur≥0 such that, with wi:=Θvi,
For an inverse temperature β>0, the partition function of H is Z:=Tre−βH and the free energy is Fβ:=−β−1logZ. We let E0 denote the smallest eigenvalue of H and define Λ:=∥h∥1+∑iUi. Our main result is the following theorem.
Theorem 2 (Partition function). For any Hamiltonian H in the attractive Kramers class, there is a randomized classical algorithm that, with probability at least 3/4, outputs an estimate Z^ with (1−ϵ)Z≤Z^≤(1+ϵ)Z in time poly(N,r,β,Λ,1/ϵ).
Consequently, we can also efficiently estimate the free energy Fβ and the ground energy E0.
Corollary 3 (Free energy and ground energy). For any Hamiltonian H in the attractive Kramers class, there are randomized classical algorithms that, with probability at least 3/4, estimate Fβ to additive error ϵ in time poly(N,r,β,Λ,1/ϵ), and E0 to additive error ϵ in time poly(N,r,Λ,1/ϵ).
Related work
Fermionic quantum Monte Carlo. The prominence of quantum Monte Carlo for simulating interacting fermions can hardly be understated, with many variations tailored for whether the system is ab initio[26, 45], is a lattice model [4, 43], hosts impurities [28], and so forth. The base formulation of our algorithm resembles continuous-time quantum Monte Carlo in the interaction expansion (CT-INT) [51], although we use a Trotterized discrete-time version. To our knowledge, the general principle behind the attractive Kramers class avoiding the sign problem in this particular representation has not been fully explored. Instead, it is typically through the Hubbard-Stratonovich transformation that the lack of sign problem for Kramers-invariant systems has been recognized [WZ05]. We clarify the relation between this condition and our Theorem 1 in Appendix § 11. Other mechanisms beyond Kramers symmetry also provide positive-sign fermionic quantum Monte Carlo frameworks; see [43] for a review.
Nonetheless, special cases of Kramers symmetry leading to positivity in CT-INT have been observed in the literature previously. In [13] it was recognized that the configuration weights take the form (−U)pdet(Ap↑)det(Ap↓) where Apσ are certain Green’s functions of the model. This is always nonnegative for attractive U and Ap↑=Ap↓ real, which is indeed the case for attractive Kramers-invariant Hubbard models. They also point out that this holds for repulsive models at half filling on bipartite lattices. The comprehensive review by [28] also discusses this phenomenon, although their treatment concerns impurity models which may additionally exhibit different, model-specific positivity mechanisms [YCK+05].
Worm techniques for Markov chains. A prominent feature of Markov chain Monte Carlo techniques is that drastic update rules are allowed even if they do not necessarily directly correspond to physical processes. As long as the chain still converges to the target distribution and results in a faster convergence, a wild update method is even encouraged. The worm (also known as directed loops) method can be understood as a broad family of update rules where one needs to sample from a configuration representation with local constraints. Examples range from constrained classical models [46] such as dimer models [57], vertex models [61], and loop models [39] to quantum models including spin [38, 60], bosonic [48, 14], and fermionic models [16, 15, 29, 64].
The diverse scope of the worm algorithm reflects the curious commonality in many highly-constrained configurations: they tend to allow two violations to be created. The idea of the worm method is then to let the two violations (also referred to as the worm head and tail) to engage in random walks, until they meet again and pair-annihilate, ending up in another constrained configuration. This could be seen as a condensed-matter physics rediscovery of the Jerrum-Sinclair chain for sampling perfect matchings using random walks of pair-created defects [19, 35]. For physical worm algorithms, the worm heads can be understood as an auxiliary source term in the Hamiltonian, and enables direct and often more efficient sampling of correlation functions [47, 14, 55].
Efficient classical algorithms for quantum many-body problems. Here we give a nonexhaustive overview of classical algorithms for computing ground energies or partition functions in polynomial time. Although we do not review quantum algorithmic developments, mapping out the classical landscape is important for ruling out regimes where superpolynomial quantum advantage cannot be obtained.
For spin systems, the ground states of one-dimensional gapped chains can be rigorously treated via matrix product states [41, 7], validating their empirical success [66]. Beyond one dimension, ferromagnetic transverse-field Ising models were shown to admit efficient partition function estimation [18] by reducing to the classical case [36]. This was later subsumed by similar guarantees for ferromagnetic XY models [11] via reduction to sampling matchings [35]. Subsequent work proved that a genuine quantum Monte Carlo algorithm, implemented in practice for such XY systems, also features a fast mixing Markov chain with significantly improved bounds [RT25]. This is in line with a body of work showing not only that a quantum spin system can be efficiently simulated, but that a particular instantiation of quantum Monte Carlo accomplishes this task [CS25, [21, 63]. The models covered by these works include quantum Ising, XY, and Heisenberg models within a variety of parameter and temperature regimes. In particular, the ferromagnetic Heisenberg model (and hence also the antiferromagnetic bipartite Heisenberg model) was recently shown to admit a fast mixing Markov chain for sampling from its partition function [22]. This result not only solves a major open problem in quantum many-body theory, but has applications to a remarkable number of other fields.
For fermionic systems, the above techniques can be applied whenever there exists a mapping from the fermions to a qualifying local spin system. However this is rather restrictive, especially beyond one dimension. The works of [JJP+26, ABC+26] considered the quantum impurity model [10], a strongly interacting system wherein the interactions are localized to a constant-size region. Their algorithms are efficient for ground energies and partition functions with polynomial inverse-temperature dependence. Besides this, however, known results are mostly confined to high-temperature thermal properties; for example, on bounded-degree interaction graphs above a critical temperature [49], in perturbative regimes [23, 33], or for random Hamiltonian models [62].
Discussion
We have presented, to our knowledge, the first polynomial-time guarantees for fermionic quantum Monte Carlo. Our algorithm applies to attractive fermionic systems with Kramers symmetry, a subclass of fermionic Lee-Yang Hamiltonians [50] that exhibit no sign problem [WZ05]. These results therefore rigorously validate decades of numerical success of methods such as determinant quantum Monte Carlo and its variants applied to such systems [32, 67, 4, 43].
Notably, our algorithm is not itself a variant of determinant quantum Monte Carlo. Instead, we developed a determinantal worm Markov chain approach to a discrete-time version of continuous-time quantum Monte Carlo [51]. While worm-type updates have been utilized in fermionic quantum Monte Carlo before [16, 29, 64], our technique is systematically applicable to every Hamiltonian in the attractive Kramers class and has provable guarantees. Due to the power of such techniques, both theoretically and in practice, we hope that these ideas motivate further interest in worm Markov chains for fermionic systems.
Along with analogous results for spin systems [8, 56, 11 RT25, 22], our results also provide evidence that the intersection of Lee-Yang and stoquasticity may be a broader guiding principle for when quantum systems admit efficient classical simulation. For instance, even within the spin Lee-Yang Hamiltonians, the recent result of [22] gives efficient classical simulation of Hamiltonians that are mappable to six-vertex models. But the spin Lee-Yang class also contains stoquastic (after a local basis rotation) Hamiltonians that are not mappable to these models. Currently, we do not have a provably efficient classical algorithm for such Hamiltonians. Similarly on the fermionic side, there are sign-problem-free fermionic Hamiltonians via Majorana reflection positivity [68] that also have a Lee-Yang property [50]. We expect all of these Hamiltonians to be efficiently classically simulable, and we leave that exploration for future research.
Technical overview
The quantum Monte Carlo algorithm
Our quantum Monte Carlo algorithm estimates the partition function in three steps. We first write the Trotter approximation of the partition function as a sum of nonnegative weights over classical configurations. Estimating this sum then reduces to sampling the configurations. Finally, we define a Markov chain that samples these configurations from a enlarged configuration space, where the enlarged space comes from adding a small pairing field to the Hamiltonian.
The first step uses standard Trotterization techniques. Split e−βH into M Trotter steps of length δ:=β/M and write
A polynomially large M suffices to control the Trotter error between LM and e−βH (§ 4.4). Each Trotter step L contains every interaction factor (I−2δVi) twice, so LM contains 2rM such factors. We refer to these factors as insertions, indexed by K:=[M]×[2r]. Insertion k has the form I+ckPk, where ck:=δUi/2 and Pk:=n(vi)n(wi) with interaction i at that position. Expanding every insertion into its two terms, I and ckPk, turns Tr[LM] into a sum over the sets X⊆K of insertions at which ckPk is chosen. Each term can be expressed as a free-fermion expectation value, hence by Wick’s theorem [27, 17] we may write it as the determinant of two-point correlation functions of H0. Specifically, in § 4.2 we show that each term is proportional to a principal minor of a global Green’s function matrix G∈C2∣K∣×2∣K∣. Each insertion contributes two rows and two columns to G, which we call its block row and its block column. The block row comes from the two annihilation operators in Pk, and the block column from the two creation operators. Writing G[X] for the principal submatrix on the block rows and block columns in X, we get that
Tr[LM]=Z0X⊆K∑detG[X],(4)
where Z0 is the efficiently computable partition function of H0. This is the discrete-time analogue of the interaction expansion used in continuous-time quantum Monte Carlo [51].
References
[1]Yeganeh Alimohammadi, Nima Anari, Kirankumar Shiragur, and Thuy-Duong Vuong. Fractionally log-concave and sector-stable polynomials: counting planar matchings and more. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 433–446, 2021.arxiv.org/abs/2102.02708
[2]Srinivasan Arunachalam, Sergey Bravyi, Anirban Chowdhury, Arkopal Dutt, Alexandru Gheorghiu, and Zhi Li. Quantum impurity models: easy at equilibrium, universal in motion. arXiv:2610.02130, 2026. URL: https://arxiv.org/abs/2610.02130.
[3]Daniel P Arovas, Erez Berg, Steven A Kivelson, and Srinivas Raghu. The Hubbard model. Annual Review of Condensed Matter Physics, 13(1):239–274, 2022. doi: 10.1146/annurev-conmatphys-031620-102024.DOI
[4]Fakher F Assaad and Hans G Evertz. World-line and determinantal quantum Monte Carlo methods for spins, phonons and electrons. In Computational Many-Particle Physics, pages 277–356. Springer, 2008. doi:10.1007/978-3-540-74686-7_10.DOI
[5]Semyon Alesker. Non-commutative linear algebra and plurisubharmonic functions of quaternionic variables. Bulletin des Sciences Mathématiques, 127(1):1–35, 2003. doi:10.1016/S0007-4497(02)00004-0.DOI
[6]Nima Anari, Kuikui Liu, Shayan Oveis Gharan, and Cynthia Vinzant. Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid. Annals of Mathematics, 199(1):259–299, 2024. doi:10.4007/annals.2024.199.1.4.DOI
[7]Itai Arad, Zeph Landau, Umesh Vazirani, and Thomas Vidick. Rigorous RG algorithms and area laws for low energy eigenstates in 1D. Communications in Mathematical Physics, 356(1):65–105, 2017. doi:10.1007/s00220-017-2973-z.DOI
[8]Taro Asano. Theorems on the partition functions of the Heisenberg ferromagnets. Journal of the Physical Society of Japan, 29(2):350–359, 1970. doi:10.1143/JPSJ.29.350.DOI
[9]Helmer Aslaksen. Quaternionic determinants. In Mathematical Conversations: Selections from The Mathematical Intelligencer, pages 142–156. Springer, New York, NY, 2001. doi:10.1007/978-1-4613-0195-0_13.DOI
[10]Sergey Bravyi and David Gosset. Complexity of quantum impurity problems. Communications in Mathematical Physics, 356(2):451–500, 2017. arXiv:1609.00735, doi:10.1007/s00220-017-2976-9.DOI
[11]Sergey Bravyi and David Gosset. Polynomial-time classical simulation of quantum ferromagnets. Physical Review Letters, 119(10):100503, 2017. arXiv:1612.05602, doi:10.1103/PhysRevLett.119.100503.DOI
[12]Sergey Bravyi, David Gosset, Yinchen Liu, and Benjamin Wong. Efficient quantum algorithm for Heisenberg spin systems, 2026. arXiv:2607.14401.arxiv.org/abs/2607.14401
[13]Evgueni Bourovski, Nikolay Prokof’ev, and Boris Svistunov. Truncated-determinant diagrammatic Monte Carlo for fermions with contact interaction. Physical Review B, 70:193101, 2004. URL: https://link.aps.org/doi/10.1103/PhysRevB.70.193101, doi:10.1103/PhysRevB.70.193101.DOI
[14]M. Boninsegni, N. V. Prokof’ev, and B. V. Svistunov. Worm algorithm and diagrammatic Monte Carlo: A new approach to continuous-space path integral Monte Carlo simulations. Phys. Rev. E, 74:036701, Sep 2006. URL: https://link.aps.org/doi/10.1103/PhysRevE.74.036701, doi:10.1103/PhysRevE.74.036701.DOI
[15]Evgeni Burovski, Nikolay Prokof’ev, Boris Svistunov, and Matthias Troyer. Critical temperature and thermodynamics of attractive fermions at unitarity. Phys. Rev. Lett., 96:160402, Apr 2006. URL: https://link.aps.org/doi/10.1103/PhysRevLett.96.160402, doi:10.1103/PhysRevLett.96.160402.DOI
[16]Evgeni Burovski, Nikolay Prokof’ev, Boris Svistunov, and Matthias Troyer. The Fermi-Hubbard model at unitarity. New Journal of Physics, 8(8):153, 2006. arXiv:cond-mat/0605350, doi:10.1088/1367-2630/8/8/153.DOI
[17]Sergey Bravyi. Lagrangian representation for fermionic linear optics. Quantum Information and Computation, 5(3):216–238, 2005. URL: https://arxiv.org/abs/quant-ph/0404180, doi:10.26421/qic5.3.
[18]Sergey Bravyi. Monte Carlo simulation of stoquastic Hamiltonians. Quantum Information and Computation, 15(13–14):1122–1140, 2015. arXiv:1402.2295, doi:10.26421/QIC15.13-14-3.DOI
[19]Andrei Z Broder. How hard is it to marry at random?(on the approximation of the permanent). In Proceedings of the eighteenth annual ACM symposium on Theory of computing, pages 50–58, 1986.DOI
[20]R. Blankenbecler, D. J. Scalapino, and R. L. Sugar. Monte Carlo calculations of coupled boson-fermion systems. i. Physical Review D, 24:2278–2286, 1981. URL: https://link.aps.org/doi/10.1103/PhysRevD.24.2278, doi:10.1103/PhysRevD.24.2278.DOI
[21]Elizabeth Crosson and Aram W. Harrow. Rapid mixing of path integral Monte Carlo for 1D stoquastic Hamiltonians. Quantum, 5:395, 2021. arXiv:1812.02144, doi:10.22331/q-2021-02-11-395.DOI
[22][CL26] Xiaoyu Chen and Kuikui Liu. An fpras for counting common bases of two matroids, October 2026. arXiv:2610.06724.arxiv.org/abs/2610.06724
[23][CRC+25] Hongrui Chen, Cambyse Rouzé, Jielun Chen, Jiaqiang Jiang, Samuel O. Scalet, Yongtao Zhan, Garnet Kin-Lic Chan, Lexing Ying, and Yu Tong. Convergence of the cumulant expansion and polynomial-time algorithm for weakly interacting fermions, 2025. arXiv:2512.12010.arxiv.org/abs/2512.12010
[24][CS25] Elizabeth Crosson and Samuel Slezak. Classical simulation of high temperature quantum Ising models. Quantum, 9:1788, 2025. doi:10.22331/q-2025-07-09-1788.DOI
[25][CST+21] Andrew M. Childs, Yuan Su, Minh C. Tran, Nathan Wiebe, and Shuchen Zhu. Theory of Trotter error with commutator scaling. Physical Review X, 11(1):011020, 2021. doi:10.1103/PhysRevX.11.011020.DOI
[26][FMNR01] W. M. C. Foulkes, L. Mitas, R. J. Needs, and G. Rajagopal. Quantum Monte Carlo simulations of solids. Reviews of Modern Physics, 73:33–83, 2001. URL: https://link.aps.org/doi/10.1103/RevModPhys.73.33, doi:10.1103/RevModPhys.73.33.DOI
[27][Gau60] Michel Gaudin. Une démonstration simplifiée du théorème de Wick en mécanique statistique. Nuclear Physics, 15:89–91, 1960. doi:10.1016/0029-5582(60)90285-6.DOI
[28][GML+11] Emanuel Gull, Andrew J. Millis, Alexander I. Lichtenstein, Alexey N. Rubtsov, Matthias Troyer, and Philipp Werner. Continuous-time Monte Carlo methods for quantum impurity models. Reviews of Modern Physics, 83(2):349–404, 2011. doi:10.1103/RevModPhys.83.349.DOI
[29][GW10] Olga Goulko and Matthew Wingate. Thermodynamics of balanced and slightly spin-imbalanced Fermi gases at unitarity. Physical Review A, 82(5):053621, 2010. doi:10.1103/PhysRevA.82.053621.DOI
[30][Has13] Matthew B. Hastings. Obstructions to classically simulating the quantum adiabatic algorithm. Quantum Information and Computation, 13(11–12):1038–1076, 2013. With an appendix by Michael H. Freedman. arXiv:1302.5733, doi:10.26421/QIC13.11-12-8.DOI
[31][Hir83] J. E. Hirsch. Discrete Hubbard-Stratonovich transformation for fermion lattice models. Physical Review B, 28(7):4059–4061, 1983. doi:10.1103/PhysRevB.28.4059.DOI
[32][Hir85] J. E. Hirsch. Two-dimensional Hubbard model: Numerical simulation study. Physical Review B, 31:4403–4419, 1985. URL: https://link.aps.org/doi/10.1103/PhysRevB.31.4403, doi:10.1103/PhysRevB.31.4403.DOI
[33][HZL26] Zhengyi Han, Yuanchen Zhao, and Zi-Wen Liu. Weakly interacting fermionic Gibbs states are Gaussian mixtures and classically simulable. arXiv:2609.35159, 2026. URL: https://arxiv.org/abs/2609.35159.
[35]Mark Jerrum and Alistair Sinclair. Approximating the permanent. SIAM Journal on Computing, 18(6):1149–1178, 1989. doi:10.1137/0218077.DOI
[36]Mark Jerrum and Alistair Sinclair. Polynomial-time approximation algorithms for the Ising model. SIAM Journal on Computing, 22(5):1087–1116, 1993. doi:10.1137/0222066.DOI
[37]Mark R. Jerrum, Leslie G. Valiant, and Vijay V. Vazirani. Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science, 43:169–188, 1986. doi:10.1016/0304-3975(86)90174-X.DOI
[38]V. A. Kashurnikov, N. V. Prokof’ev, B. V. Svistunov, and M. Troyer. Quantum spin chains in a magnetic field. Phys. Rev. B, 59:1162–1167, Jan 1999. URL: https://link.aps.org/doi/10.1103/PhysRevB.59.1162, doi:10.1103/PhysRevB.59.1162.DOI
[39]Qingquan Liu, Youjin Deng, and Timothy M. Garoni. Worm Monte Carlo study of the honeycomb-lattice loop model. Nuclear Physics B, 846(2):283–315, 2011. URL: https://www.sciencedirect.com/science/article/pii/S0550321311000046, doi: 10.1016/j.nuclphysb.2011.01.003.DOI
[40]Zi-Xiang Li, Yi-Fan Jiang, and Hong Yao. Majorana-time-reversal symmetries: a fundamental principle for sign-problem-free quantum Monte Carlo simulations. Physical Review Letters, 117(26):267002, 2016. arXiv:1601.05780, doi:10.1103/PhysRevLett.117.267002.DOI
[41]Zeph Landau, Umesh Vazirani, and Thomas Vidick. A polynomial time algorithm for the ground state of one-dimensional gapped local Hamiltonians. Nature Physics, 11(7):566–569, 2015. doi:10.1038/nphys3345.DOI
[42]T. D. Lee and C. N. Yang. Statistical theory of equations of state and phase transitions. II. lattice gas and Ising model. Physical Review, 87(3):410–419, 1952. doi:10.1103/PhysRev.87.410.DOI
[43]Zi-Xiang Li and Hong Yao. Sign-problem-free fermionic quantum Monte Carlo: Developments and applications. Annual Review of Condensed Matter Physics, 10(1):337–356, 2019. doi:10.1146/annurev-conmatphys-033117-054307.DOI
[44]Milad Marvian, Daniel A. Lidar, and Itay Hen. On the computational complexity of curing non-stoquastic Hamiltonians. Nature Communications, 10(1):1571, 2019. doi:10.1038/s41467-019-09501-6.DOI
[45]Mario Motta and Shiwei Zhang. Ab initio computations of molecular systems by the auxiliary-field quantum Monte Carlo method. Wiley Interdisciplinary Reviews: Computational Molecular Science, 8(5):e1364, 2018. doi:10.1002/wcms.1364.DOI
[46]Nikolay Prokof’ev and Boris Svistunov. Worm algorithms for classical statistical models. Physical Review Letters, 87(16):160601, 2001. doi:10.1103/PhysRevLett.87.160601.DOI
[47]N. V. Prokof’ev, B. V. Svistunov, and I. S. Tupitsyn. Exact, complete, and universal continuous-time worldline Monte Carlo approach to the statistics of discrete quantum systems. Journal of Experimental and Theoretical Physics, 87(2):310–321, 1998. doi:10.1134/1.558661.DOI
[48]N.V Prokof’ev, B.V Svistunov, and I.S Tupitsyn. “Worm” algorithm in quantum Monte Carlo simulations. Physics Letters A, 238(4):253–257, 1998. URL: https://www.sciencedirect.com/science/article/pii/S0375960197009572, doi:10.1016/S0375-9601(97)00957-2.DOI
[49]Akshar Ramkumar, Yiyi Cai, Yu Tong, and Jiaqing Jiang. High-temperature fermionic Gibbs states are mixtures of Gaussian states. Physical Review Letters, 137(2):020601, 2026. doi:10.1103/qprk-k7wn.DOI
[50]Chaithanya Rayudu, Takahiro Misawa, Andrew Zhao, and Jun Takahashi. Lee-Yang theorem for fermions, 2026. arXiv:2609.23942.arxiv.org/abs/2609.23942
[51]A. N. Rubtsov, V. V. Savkin, and A. I. Lichtenstein. Continuous-time quantum Monte Carlo method for fermions. Physical Review B, 72(3):035122, 2005. doi:10.1103/PhysRevB.72.035122.DOI
[53]Chaithanya Rayudu and Jun Takahashi. Spectral gap of Lee-Yang Hamiltonians, 2026. arXiv:2607.10765.arxiv.org/abs/2607.10765
[54]Anders W. Sandvik. Stochastic series expansion method with operator-loop update. Physical Review B, 59(22):R14157–R14160, 1999. arXiv:cond-mat/9902226, doi:10.1103/PhysRevB.59.R14157.DOI
[55]Anders W Sandvik. Computational studies of quantum spin systems. In AIP Conference Proceedings, volume 1297, pages 135–338. American Institute of Physics, 2010. doi:10.1063/1.3518900.DOI
[56]Masuo Suzuki and Michael E. Fisher. Zeros of the partition function for the Heisenberg, ferroelectric, and general Ising models. Journal of Mathematical Physics, 12(2):235–246, 1971. doi:10.1063/1.1665583.DOI
[57]Anders W. Sandvik and R. Moessner. Correlations and confinement in nonplanar two-dimensional dimer models. Phys. Rev. B, 73:144504, Apr 2006. URL: https://link.aps.org/doi/10.1103/PhysRevB.73.144504, doi:10.1103/PhysRevB.73.144504.DOI
[58]J. J. Sakurai and Jim Napolitano. Modern Quantum Mechanics. Cambridge University Press, 3rd edition, 2020.
[59]D. J. Scalapino and R. L. Sugar. Method for performing Monte Carlo calculations for systems with fermions. Physical Review Letters, 46:519–521, 1981. URL: https://link.aps.org/doi/10.1103/PhysRevLett.46.519, doi:10.1103/PhysRevLett.46.519.DOI
[60]Olav F. Syljuåsen and Anders W. Sandvik. Quantum Monte Carlo with directed loops. Phys. Rev. E, 66:046701, Oct 2002. URL: https://link.aps.org/doi/10.1103/PhysRevE.66.046701, doi:10.1103/PhysRevE.66.046701.DOI
[61]Olav F. Syljuåsen and M. B. Zvonarev. Directed-loop Monte Carlo simulations of vertex models. Phys. Rev. E, 70:016118, Jul 2004. URL: https://link.aps.org/doi/10.1103/PhysRevE.70.016118, doi:10.1103/PhysRevE.70.016118.DOI
[62]Alexander Schmidhuber and Alexander Zlokapa. Polynomial-time classical algorithms for mean-field models up to the glass transition. arXiv:2610.06807, 2026. URL: https://arxiv.org/abs/2610.06807.
[63]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, 2024. URL: https://arxiv.org/abs/2411.01452.
[64]Lei Wang, Philippe Corboz, and Matthias Troyer. Fermionic quantum critical point of spinless fermions on a honeycomb lattice. New Journal of Physics, 16(10):103008, 2014. doi:10.1088/1367-2630/16/10/103008.DOI
[65]Zhong-Chao Wei. Semigroup approach to the sign problem in quantum Monte Carlo simulations. Physical Review B, 110:075146, 2024. URL: https://link.aps.org/doi/10.1103/PhysRevB.110.075146, doi:10.1103/PhysRevB.110.075146.DOI
[66]Steven R. White. Density matrix formulation for quantum renormalization groups. Physical Review Letters, 69:2863–2866, 1992. URL: https://link.aps.org/doi/10.1103/PhysRevLett.69.2863, doi:10.1103/PhysRevLett.69.2863.DOI
[67]S. R. White, D. J. Scalapino, R. L. Sugar, E. Y. Loh, J. E. Gubernatis, and R. T. Scalettar. Numerical study of the two-dimensional Hubbard model. Phys. Rev. B, 40:506–516, 1989. URL: https://link.aps.org/doi/10.1103/PhysRevB.40.506, doi:10.1103/PhysRevB.40.506.DOI
[68]Z. C. Wei, Congjun Wu, Yi Li, Shiwei Zhang, and T. Xiang. Majorana positivity and the fermion sign problem of quantum Monte Carlo simulations. Physical Review Letters, 116(25):250601, 2016. arXiv:1601.01994, doi:10.1103/PhysRevLett.116.250601.DOI