{"paper":{"title":"Efficient continuous-time quantum Monte Carlo algorithm for fermionic lattice models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cond-mat.str-el","authors_text":"Matthias Troyer, Mauro Iazzi","submitted_at":"2014-11-03T21:00:17Z","abstract_excerpt":"Efficient continuous time quantum Monte Carlo (CT-QMC) algorithms that do not suffer from time discretization errors have become the state-of-the-art for most discrete quantum models. They have not been widely used yet for fermionic quantum lattice models, such as the Hubbard model, due to a suboptimal scaling of $O(\\beta^3)$ with inverse temperature $\\beta$, compared to the linear scaling of discrete time algorithms. Here we present a CT-QMC algorithms for fermionic lattice models that matches the scaling of discrete-time methods but is more efficient and free of time discretization errors. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0683","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}