Addressing the infinite variance problem in fermionic Monte Carlo simulations: Retrospective error remediation and the exact bridge link method

We revisit the infinite variance problem in fermionic Monte Carlo simulations, which is widely encountered in areas ranging from condensed matter to nuclear and high-energy physics. The different algorithms, which we broadly refer to as determinantal quantum Monte Carlo (DQMC), are applied in many situations and differ in details, but they share a foundation in field theory, and often involve fermion determinants whose symmetry properties make the algorithm sign-problem-free. We show that the infinite variance problem arises as the observables computed in DQMC tend to form heavy-tailed distributions. To remedy this issue retrospectively, we introduce a tail-aware error estimation method to correct the otherwise unreliable estimates of confidence intervals. Furthermore, we demonstrate how to perform DQMC calculations that eliminate the infinite variance problem for a broad class of observables. Our approach is an exact bridge link method, which involves a simple and efficient modification to the standard DQMC algorithm. The method introduces no systematic bias and is straightforward to implement with minimal computational overhead. Our results establish a practical and robust solution to the infinite variance problem, with broad implications for improving the reliability of a variety of fundamental fermion simulations.

Authors

Institutions

Publication Details

Journal
Physical review. E
Published
2025-11-24
DOI
https://doi.org/10.1103/s4zw-qt8f
Primary Topic
Quantum many-body systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Addressing the infinite variance problem in fermionic Monte Carlo simulations: Retrospective error remediation and the exact bridge link method

Zhou‐Quan Wan, Shiwei Zhang
Physical review. E
Quantum many-body systems
article

Addressing the infinite variance problem in fermionic Monte Carlo simulations: Retrospective error remediation and the exact bridge link method

Zhou‐Quan Wan, Shiwei Zhang
article en

Abstract

We revisit the infinite variance problem in fermionic Monte Carlo simulations, which is widely encountered in areas ranging from condensed matter to nuclear and high-energy physics. The different algorithms, which we broadly refer to as determinantal quantum Monte Carlo (DQMC), are applied in many situations and differ in details, but they share a foundation in field theory, and often involve fermion determinants whose symmetry properties make the algorithm sign-problem-free. We show that the infinite variance problem arises as the observables computed in DQMC tend to form heavy-tailed distributions. To remedy this issue retrospectively, we introduce a tail-aware error estimation method to correct the otherwise unreliable estimates of confidence intervals. Furthermore, we demonstrate how to perform DQMC calculations that eliminate the infinite variance problem for a broad class of observables. Our approach is an exact bridge link method, which involves a simple and efficient modification to the standard DQMC algorithm. The method introduces no systematic bias and is straightforward to implement with minimal computational overhead. Our results establish a practical and robust solution to the infinite variance problem, with broad implications for improving the reliability of a variety of fundamental fermion simulations.

Physical review. EVol. 112(6)
Flatiron Health (United States) (US), Flatiron Institute (US)
Openalex Percentile: Top 68%
Quantum many-body systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.