Algorithmic aspects of gauged Gaussian fermionic projected entangled pair states
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
Lattice gauge theories (LGTs) provide a powerful framework for studying non-perturbative phenomena in gauge theories. However, conventional approaches such as Monte Carlo (MC) simulations in imaginary time are limited, as they do not allow real time evolution and suffer from a sign problem in many important cases. Using Gauged Gaussian fermionic projected entangled pair states (GGFPEPS) as a variational ground state ansatz offers an alternative for studying LGTs through a sign-problem-free variational MC. As this method is extended to larger and more complex systems, understanding its numerical behavior becomes essential. While conventional action based MC has been extensively studied, the performance and characteristics of non-action-based MC within the GGFPEPS framework are far less explored. In this work, we investigate these algorithmic aspects, identifying an optimal update size for GGFPEPS-based MC simulations for $\mathbb{Z}_2$ in $2+1$ dimensions. We show that gauge fixing generally slows convergence, and demonstrate that not exploiting the translation-invariance can, in some cases, improve the computational time scaling of error convergence. We expect that these improvements will allow advancing the simulation to larger and more complex systems.