Efficient scheduling of particle annihilation for long-time Wigner simulations

Particle annihilation (PA) plays an indispensable role in alleviating the numerical sign problem in long-time simulations with the Wigner branching random walk (WBRW) method. However, the effect of PA frequency on long-time accuracy remains poorly understood, leaving its choice largely empirical. To provide systematic guidance for PA scheduling, we establish an overall error estimate for PA through a uniform mesh, separating WBRW variance, resampling variance and squared bias. The analysis shows that, beyond merely controlling particle growth, PA replaces the exponential-in-time variance bound with a linear-in-time bound, thereby alleviating the numerical sign problem. It also reveals bias-variance trade-off induced by PA frequency: frequent PA limits variance but can increase accumulated bias. More importantly, building on the newfound error structure, we propose a variance-constrained cost optimization strategy for adaptive PA scheduling across several PA methods. An intrinsic-time reparameterization provides a common clock for variance control, PA scheduling, and branching dynamics under time-dependent potentials. Numerical experiments validate the theoretical variance behavior and bias-variance trade-off, and results of our schedule populate the low-cost regime of the empirical Pareto frontier objecting to balance accuracy and efficiency.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-16
DOI
https://doi.org/10.48550/arxiv.2611.20426
Primary Topic
Theoretical and Computational Physics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Efficient scheduling of particle annihilation for long-time Wigner simulations

Sihong Shao, Jinyang Huang, Yuxuan Zhang
arXiv (Cornell University)
Theoretical and Computational Physics
preprint

Efficient scheduling of particle annihilation for long-time Wigner simulations

Sihong Shao, Jinyang Huang, Yuxuan Zhang
preprint en

Abstract

Particle annihilation (PA) plays an indispensable role in alleviating the numerical sign problem in long-time simulations with the Wigner branching random walk (WBRW) method. However, the effect of PA frequency on long-time accuracy remains poorly understood, leaving its choice largely empirical. To provide systematic guidance for PA scheduling, we establish an overall error estimate for PA through a uniform mesh, separating WBRW variance, resampling variance and squared bias. The analysis shows that, beyond merely controlling particle growth, PA replaces the exponential-in-time variance bound with a linear-in-time bound, thereby alleviating the numerical sign problem. It also reveals bias-variance trade-off induced by PA frequency: frequent PA limits variance but can increase accumulated bias. More importantly, building on the newfound error structure, we propose a variance-constrained cost optimization strategy for adaptive PA scheduling across several PA methods. An intrinsic-time reparameterization provides a common clock for variance control, PA scheduling, and branching dynamics under time-dependent potentials. Numerical experiments validate the theoretical variance behavior and bias-variance trade-off, and results of our schedule populate the low-cost regime of the empirical Pareto frontier objecting to balance accuracy and efficiency.

arXiv (Cornell University)
Theoretical and Computational Physics
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.

Laika access coming soon