English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We present a solution to the sign problem in dynamical random matrixsimulations of a two-matrix model at nonzero chemical potential. The signproblem, caused by the complex fermion determinants, is solved by gathering thematrices into subsets, whose sums of determinants are real and positive eventhough their cardinality only grows linearly with the matrix size. A detailedproof of this positivity theorem is given for an arbitrary number of fermionflavors. We performed importance sampling Monte Carlo simulations to computethe chiral condensate and the quark number density for varying chemicalpotential and volume. The statistical errors on the results only show a milddependence on the matrix size and chemical potential, which confirms theabsence of sign problem in the subset method. This strongly contrasts with theexponential growth of the statistical error in standard reweighting methods,which was also analyzed quantitatively using the subset method. Finally, weshow how the method elegantly resolves the Silver Blaze puzzle in themicroscopic limit of the matrix model, where it is equivalent to QCD.

A subset solution to the sign problem in random matrix simulations