
TL;DR
This paper discusses algorithms for efficient lattice simulations of large-N symmetric field theories, enabling the study of real-time dynamics and quenches despite sign problems.
Contribution
It introduces a family of algorithms that leverage the large-N limit for efficient real-time lattice simulations with sign problems.
Findings
Algorithms enable real-time simulations at large N
Effective handling of sign problems in fermionic theories
Facilitates study of quenches and dynamic observables
Abstract
The large- limit of -symmetric bosonic field theories, or -symmetric fermionic field theories, is amenable to a saddle point approximation. As a result, there is a family of closely related algorithms for efficient lattice simulations in this limit, even in the presence of fermionic or real-time sign problems. These can be used to study quenches, or other observables for which
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Chromodynamics and Particle Interactions · Distributed and Parallel Computing Systems · Particle physics theoretical and experimental studies
