Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userFermion Sign Problem in Path Integral Monte Carlo Simulations: Grand-canonical ensemble
87
0
0.0
(
0
)
Authors
Tobias Dornheim
Ask ChatGPT about the research
No Arabic abstract
We present a practical analysis of the fermion sign problem in fermionic path integral Monte Carlo (PIMC) simulations in the grand-canonical ensemble (GCE). As a representative model system, we consider electrons in a $2D$ harmonic trap. We find that the sign problem in the GCE is even more severe than in the canonical ensemble at the same conditions, which, in general, makes the latter the preferred option. Despite these difficulties, we show that fermionic PIMC simulations in the GCE are still feasible in many cases, which potentially gives access to important quantities like the compressiblity or the Matsubara Greens function. This has important implications for contemporary fields of research such as warm dense matter, ultracold atoms, and electrons in quantum dots.
rate research
Read More
We show how canonical ensemble expectation values can be extracted from quantum Monte Carlo simulations in the grand canonical ensemble. In order to obtain results for all particle sectors, a modest number of grand canonical simulations must be performed, each at a different chemical potential. From the canonical ensemble results, grand canonical expectation values can be extracted as a continuous function of the chemical potential. Results are presented from the application of this method to the two-dimensional Hubbard model.
Quantum Monte Carlo belongs to the most accurate simulation techniques for quantum many-particle systems. However, for fermions, these simulations are hampered by the sign problem that prohibits simulations in the regime of strong degeneracy. The situation changed with the development of configuration path integral Monte Carlo (CPIMC) by Schoof textit{et al.} [T. Schoof textit{et al.}, Contrib. Plasma Phys. textbf{51}, 687 (2011)] that allowed for the first textit{ab initio} simulations for dense quantum plasmas. CPIMC also has a sign problem that occurs when the density is lowered, i.e. in a parameter range that is complementary to traditional QMC formulated in coordinate space. Thus, CPIMC simulations for the warm dense electron gas are limited to small values of the Brueckner parameter -- the ratio of the interparticle distance to the Bohr radius -- $r_s=bar{r}/a_B lesssim 1$. In order to reach the regime of stronger coupling (lower density) with CPIMC, here we investigate additional restrictions on the Monte Carlo procedure. In particular, we introduce two differe
We detail the use of simple machine learning algorithms to determine the critical Bose-Einstein condensation (BEC) critical temperature $T_text{c}$ from ensembles of paths created by path-integral Monte Carlo (PIMC) simulations. We quickly overview critical temperature analysis methods from literature, and then compare the results of simple machine learning algorithm analyses with these prior-published methods for one-component Coulomb Bose gases and liquid $^4$He, showing good agreement.
The large surface density changes associated with the (100) noble metals surface hex-reconstruction suggest the use of non-particle conserving simulation methods. We present an example of a surface Grand Canonical Monte Carlo applied to the transformation of a square non reconstructed surface to the hexagonally covered low temperature stable Au(100). On the other hand, classical Molecular Dynamics allows to investigate microscopic details of the reconstruction dynamics, and we show, as an example, retraction of a step and its interplay with the surface reconstruction/deconstruction mechanism.
We propose a minimal generalization of the celebrated Markov-Chain Monte Carlo algorithm which allows for an arbitrary number of configurations to be visited at every Monte Carlo step. This is advantageous when a parallel computing machine is available, or when many biased configurations can be evaluated at little additional computational cost. As an example of the former case, we report a significant reduction of the thermalization time for the paradigmatic Sherrington-Kirkpatrick spin-glass model. For the latter case, we show that, by leveraging on the exponential number of biased configurations automatically computed by Diagrammatic Monte Carlo, we can speed up computations in the Fermi-Hubbard model by two orders of magnitude.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
