REVIEW 5 cited by
Approaches to the sign problem in lattice field theory
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
Approaches to the sign problem in lattice field theory
read the original abstract
Quantum field theories (QFTs) at finite densities of matter generically involve complex actions. Standard Monte-Carlo simulations based upon importance sampling, which have been producing quantitative first principle results in particle physics for almost fourty years, cannot be applied in this case. Various strategies to overcome this so-called Sign Problem or Complex Action Problem were proposed during the last thirty years. We here review the sign problem in lattice field theories, focussing on two more recent methods: Dualization to world-line type of representations and the density-of-states approach.
Forward citations
Cited by 5 Pith papers
-
An effective field theory approach to the sign problem in BFSS
The Pfaffian phase in BFSS becomes an O(9) pseudoscalar operator in a bosonic matrix integral, requiring 10-loop order in the high-T expansion before the sign problem is detectable in the 't Hooft regime.
-
Constrained Symplectic Quantization II: The Free Scalar Field
Constrained symplectic quantization applied to the free scalar field reproduces the Feynman generating functional in the continuum limit and matches standard correlators, commutators, and Dyson-Schwinger equations in ...
-
Constrained Symplectic Quantization: Disclosing the Deterministic Framework Behind Quantum Field Theory
Constrained symplectic quantization recovers the Feynman generating functional with correct real-time prescription for relativistic QFT by analytic continuation of fields and action plus constraints on stable trajecto...
-
Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators
Qudit encodings for quadratic diagonal evolutions require exponentially stronger synthesis advantages than qubits to win asymptotically in product formulas but can yield constant-factor savings in LCU at low d.
-
Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators
The paper derives explicit finite-d break-even synthesis costs for qudit vs. qubit encodings of diagonal quadratic operators in product-formula and LCU simulations, identifying low-d regions where qudits yield savings.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.