arXiv · hep-lat/9909007
Fermion Cluster Algorithms
Abstract
Cluster algorithms have been recently used to eliminate sign problems that plague Monte-Carlo methods in a variety of systems. In particular such algorithms can also be used to solve sign problems associated with the permutation of fermion world lines. This solution leads to the possibility of designing fermion cluster algorithms in certain cases. Using the example of free non-relativistic fermions we discuss the ideas underlying the algorithm.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Shailesh Chandrasekharan. 1999-09-01. Fermion Cluster Algorithms. https://doi.org/10.1016/s0920-5632(00)91803-6
Cite the original work for its findings. Save a collection to share your selection of sources.