Pith. sign in

REVIEW 1 cited by

Application of the path optimization method to a discrete spin system

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

arxiv 2309.06018 v2 pith:5XERBSSK submitted 2023-09-12 hep-lat cond-mat.stat-mechhep-ph

classification hep-latcond-mat.stat-mechhep-ph
keywords methodoptimizationpathmodelproblemsignspinapplied
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The path optimization method, which is proposed to control the sign problem in quantum field theories with continuous degrees of freedom by machine learning, is applied to a spin model with discrete degrees of freedom. The path optimization method is applied by replacing the spins with dynamical variables via the Hubbard-Stratonovich transformation, and the sum with the integral. The one-dimensional (Lenz-)Ising model with a complex coupling constant is used as a laboratory for the sign problem in the spin model. The average phase factor is enhanced by the path optimization method, indicating that the method can weaken the sign problem. Our result reproduces the analytic values with controlled statistical errors.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Machine-learning approaches to accelerating lattice simulations

    hep-lat 2025-02 unverdicted

    A review of unbiased machine-learning acceleration methods for lattice field theory, covering flow-based sampling, contour deformations, control variates, and surrogate observables.

Pith tools