We introduce a semistochastic implementation of the power method to compute, for very large matrices, the dominant eigenvalue and expectation values involving the corresponding eigenvector. The method is semistochastic in that the matrix multiplication is partially implemented numerically exactly and partially stochastically with respect to expectation values only. Compared to a fully stochastic method, the semistochastic approach significantly reduces the computational time required to obtain the eigenvalue to a specified statistical uncertainty. This is demonstrated by the application of the semistochastic quantum Monte Carlo method to systems with a sign problem: the fermion Hubbard model and the carbon dimer
We extend the recently proposed heat-bath configuration interaction (HCI) method [Holmes, Tubman, Um...
The Wang-Landau algorithm is an adaptive Markov chain Monte Carlo algorithm to calculate the spectra...
In this paper we analyse applicability and robustness of Markov chain Monte Carlo algorithms for eig...
This thesis details four research projects related to zero temperature quantum Monte Carlo. Chapters...
This paper deals with the optimization of trial states for the computation of dominant eigenvalues o...
Conventional Quantum Monte Carlo methods, routinely used to compute properties of many-body quantum ...
Conventional Quantum Monte Carlo methods, routinely used to compute properties of many-body quantum ...
A pair-product projector, which projects onto an intrinsically Fermionic ground state, is implemente...
In this dissertation, I present my original research in the development of algorithms for computing ...
The problem of obtaining the smallest and the largest generalised eigenvalues using quasi Monte Carl...
This thesis is concerned with the development of a Projector Quantum Monte Carlo method for non-lin...
In this thesis we investigate the recently developed Full Configuration Interaction Quantum Monte Ca...
Development of exponentially scaling methods has seen great progress in tackling larger systems than...
Abstract. The problem of evaluating the dominant eigenvalue of real matrices using Monte Carlo numer...
In the many particle physics the exact diagonalization (ED) is limited to small system sizes, like 4...
We extend the recently proposed heat-bath configuration interaction (HCI) method [Holmes, Tubman, Um...
The Wang-Landau algorithm is an adaptive Markov chain Monte Carlo algorithm to calculate the spectra...
In this paper we analyse applicability and robustness of Markov chain Monte Carlo algorithms for eig...
This thesis details four research projects related to zero temperature quantum Monte Carlo. Chapters...
This paper deals with the optimization of trial states for the computation of dominant eigenvalues o...
Conventional Quantum Monte Carlo methods, routinely used to compute properties of many-body quantum ...
Conventional Quantum Monte Carlo methods, routinely used to compute properties of many-body quantum ...
A pair-product projector, which projects onto an intrinsically Fermionic ground state, is implemente...
In this dissertation, I present my original research in the development of algorithms for computing ...
The problem of obtaining the smallest and the largest generalised eigenvalues using quasi Monte Carl...
This thesis is concerned with the development of a Projector Quantum Monte Carlo method for non-lin...
In this thesis we investigate the recently developed Full Configuration Interaction Quantum Monte Ca...
Development of exponentially scaling methods has seen great progress in tackling larger systems than...
Abstract. The problem of evaluating the dominant eigenvalue of real matrices using Monte Carlo numer...
In the many particle physics the exact diagonalization (ED) is limited to small system sizes, like 4...
We extend the recently proposed heat-bath configuration interaction (HCI) method [Holmes, Tubman, Um...
The Wang-Landau algorithm is an adaptive Markov chain Monte Carlo algorithm to calculate the spectra...
In this paper we analyse applicability and robustness of Markov chain Monte Carlo algorithms for eig...