REVIEW 3 cited by
Fighting the sign problem in a chiral random matrix model with contour deformations
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We studied integration contour deformations in the chiral random matrix theory of Stephanov with the goal of alleviating the finite-density sign problem. We considered simple ans\"atze for the deformed integration contours, and optimized their parameters. We find that optimization of a single parameter manages to considerably improve on the severity of the sign problem. We show numerical evidence that the improvement achieved is exponential in the degrees of freedom of the system, i.e., the size of the random matrix. We also compare the optimization method with contour deformations coming from the holomorphic flow equations.
Forward citations
Cited by 3 Pith papers
-
Path optimization method for the sign problem: Insights from random matrix models
Path optimization improves the average phase factor in the Stephanov model at high chemical potential but not at low chemical potential or in the chiral random matrix model, pointing to the global sign problem as the ...
-
Path optimization method for the sign problem caused by fermion determinant
Path optimization with machine learning reproduces analytic results in the 1D lattice Thirring model, and dropping the Jacobian from the learning step still works.
-
Machine-learning approaches to accelerating lattice simulations
A review of unbiased machine-learning acceleration methods for lattice field theory, covering flow-based sampling, contour deformations, control variates, and surrogate observables.
Discussion (0). Continue with ORCID to comment.