The simulation of quantum systems with random walks: A new algorithm for charged systems

Research output: Contribution to journalArticlepeer-review


Random walks with branching have been used to calculate exact properties of the ground state of quantum many-body systems. In this paper, a more general Green's function identity is derived which relates the potential energy, a trial wavefunction, and a trial density matrix to the rules of a branched random walk. It is shown that an efficient algorithm requires a good trial wavefunction, a good trial density matrix, and a good sampling of this density matrix. An accurate density matrix is constructed for Coulomb systems using the path integral formula. The random walks from this new algorithm diffuse through phase space an order of magnitude faster than the previous Green's Function Monte Carlo method. In contrast to the simple diffusion Monte Carlo algorithm, it is an exact method. Representative results are presented for several molecules.

Original languageEnglish (US)
Pages (from-to)404-422
Number of pages19
JournalJournal of Computational Physics
Issue number3
StatePublished - Sep 1983
Externally publishedYes

ASJC Scopus subject areas

  • Numerical Analysis
  • Modeling and Simulation
  • Physics and Astronomy (miscellaneous)
  • Physics and Astronomy(all)
  • Computer Science Applications
  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'The simulation of quantum systems with random walks: A new algorithm for charged systems'. Together they form a unique fingerprint.

Cite this