Evading the sign problem in random matrix simulations

Details Evading the sign problem in random matrix simulations Evading the sign problem in random matrix simulations

2011-11-21

arxiv.org/abs/1111.4876v1

PoS(Lattice 2011)184

Physics

High Energy Physics

High Energy Physics - Lattice

7 pages, 3 figures, talk presented at the XXIX International Symposium on Lattice Field Theory (Lattice 2011), July 10-16, 201

Scientific paper

In this talk we show how the sign problem, occurring in dynamical simulations of random matrices at nonzero chemical potential, can be avoided by judiciously combining matrices into subsets. One can prove that these subsets have real and positive weights such that importance sampling can be used in Monte Carlo simulations. The number of matrices per subset is proportional to the matrix dimension. We measure the chiral condensate and observe that the statistical error is independent of the chemical potential and grows linearly with the matrix dimension, which contrasts strongly with its exponential growth in reweighting methods.

Affiliated with

Also associated with

No associations

Rating

Evading the sign problem in random matrix simulations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Evading the sign problem in random matrix simulations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Evading the sign problem in random matrix simulations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-377065