Path Resummations and the Fermion Sign Problem
- 3.1k Downloads
We review a recent method we have developed for Fermion quantum Monte Carlo. By using combinatorial arguments to perform resummations over paths, we reformulate the stochastic problem of sampling paths in terms of sampling “graphs”, which are much better behaved with regards sign-cancellation problems encountered in path-integral simulations of Fermions. Detailed mathematical derivations of the new results are presented.
KeywordsHubbard Model Fermion System Slater Determinant Star Graph Quantum Monte Carlo
Unable to display preview. Download preview PDF.
- 3.R. P. Feynman, A. R. Hibbs (1965) Quantum Mechanics and Path Integrals, McGraw-Hill.Google Scholar
- 6.For a comprehensive account of many quantum chemical methods see Modern Electronic Structure Theory by P. Jorgensen, J. Olsen and T. Helgaker (2000) Wiley, New YorkGoogle Scholar
- 7.J. B. Anderson (1975) Random-walk simulation of Schrodinger equation - H+3. J. Chem. Phys. 63, pp. 1499–1503; ibid. (1976) Quantum chemistry by randomwalk. 65, pp. 4121–4127Google Scholar
- 9.M. E. Tuckerman and A. Hughes (1998) In “Classical and Quantum Dynamics in condensed systems”, ed. B. J. Berne, G. Ciccotti, D. F. Coker, World ScientificGoogle Scholar
- 10.D. E. Knuth (1973) In “The Art of Computer Programming, Volume 1: Fundamental Algorithms”, Addison WesleyGoogle Scholar