betaFeedback

WorksPhysics and Astronomy

Efficient scheduling of particle annihilation for long-time Wigner simulations

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.

Paper details

vlnc:W_6vs7kh9w
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…