Search for: All records

A key component of the phase diagram of many iron-based superconductors and electron-doped cuprates is believed to be a quantum critical point (QCP), delineating the onset of antiferromagnetic spin-density wave order in a quasi-two-dimensional metal. The universality class of this QCP is believed to play a fundamental role in the description of the proximate non-Fermi liquid behavior and superconducting phase. A minimal model for this transition is the O(3) spin-fermion model. Despite many efforts, a definitive characterization of its universal properties is still lacking. Here, we numerically study the O(3) spin-fermion model and extract the scaling exponents and functional form of the static and zero-momentum dynamical spin susceptibility. We do this using a Hybrid Monte Carlo (HMC) algorithm with a novel auto-tuning procedure, which allows us to study unprecedentedly large systems of 80 × 80 sites. We find a strong violation of the Hertz-Millis form, contrary to all previous numerical results. Furthermore, the form that we do observe provides good evidence that the universal scaling is actually governed by the analytically tractable fixed point discovered near perfect “hot-spot’ nesting, even for a larger nesting window. Our predictions can be directly tested with neutron scattering. Additionally, the HMC method we introduce is generic and can be used to study other fermionic models of quantum criticality, where there is a strong need to simulate large systems.

Recent applications of machine-learned normalizing flows to sampling in lattice field theory suggest that such methods may be able to mitigate critical slowing down and topological freezing. However, these demonstrations have been at the scale of toy models, and it remains to be determined whether they can be applied to state-of-the-art lattice quantum chromodynamics calculations. Assessing the viability of sampling algorithms for lattice field theory at scale has traditionally been accomplished using simple cost scaling laws, but as we discuss in this work, their utility is limited for flow-based approaches. We conclude that flow-based approaches to sampling are better thought of as a broad family of algorithms with different scaling properties, and that scalability must be assessed experimentally.