Sub-matrix updates for the Continuous-Time Auxiliary Field algorithm

Abstract

We present a sub-matrix update algorithm for the continuous-time auxiliary field method that allows the simulation of large lattice and impurity problems. The algorithm takes optimal advantage of modern CPU architectures by consistently using matrix instead of vector operations, resulting in a speedup of a factor of $\approx 8$ and thereby allowing access to larger systems and lower temperature. We illustrate the power of our algorithm at the example of a cluster dynamical mean field simulation of the Néel transition in the three-dimensional Hubbard model, where we show momentum dependent self-energies for clusters with up to 100 sites.

References in corpus (8)

• Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
• The ALPS project release 1.3: open source software for strongly correlated systems
• Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensions
• Hybridization expansion impurity solver: General formulation and application to Kondo lattice and two-orbital models
• Continuous-time auxiliary field Monte Carlo for quantum impurity models
• Strings, Projected Entangled Pair States, and variational Monte Carlo methods
• Thermodynamics of the 3D Hubbard model on approach to the Neel transition
• Two-stage metal-insulator transition in the 2D Hubbard model: momentum selectivity in the 8-site dynamical cluster approximation

Cited by in corpus (2)

• Continuous-time Monte Carlo methods for quantum impurity models
• Spectral properties of the three-dimensional Hubbard model