Any system in the world constitutes particles like electrons. To analyze the behaviors of these systems the behavior of these particles must be predicted. The ground state energy of a molecule is the most important information about a molecule and can calculate by solving the Schrodinger equation. But as the number of atoms increase, the number of variable (coordinates of the atom) that the equation represent increases by three times. Due to the large state space and the nonlinear nature of the Schrodinger equation, it is very difficult to solver this equation. Quantum Monte Carlo (QMC) is a very efficient method to solve the Schrodinger equation for accurate results. This methods uses random numbers to sample the complex equation and get v...
This work will be focused on parallel simulation of electron-electron interactions in materials with...
The calculation of the semiclassical propagator is a Monte Carlo integration over classical trajecto...
Quantum computing proposes quantum algorithms exponentially faster than their clas- sical analogues ...
The Path-Integral Formulation of Quantum Mechanics is intro- duced along with a detailed mathematica...
Scientific computing applications demand ever-increasing performance while traditional microprocesso...
In the past few years the development of exascale computing technology necessitated to obtain an est...
Graphical Processing Units (GPUs) are highly parallel, programmable accelerators boasting high peak ...
AbstractIn the past few years the development of exascale computing technology necessitated to obtai...
Abstract: Modern videogames place increasing demands on the computational and graphical hardware, le...
Our goal was to investigate the suitability of parallel supercomputer architectures for Quantum Mont...
Many-particle continuous-time quantum walks (CTQWs) represent a resource for several tasks in quantu...
This thesis is concerned with the development and application of quantum Monte Carlo (QMC) methods f...
The major achievements enabled by QMC Endstation grant include * Performance improvement on clusters...
We will explore applications of computational methods in solving selected quantum mechanical problem...
The primary subject of this dissertation is the analysis and improvement of variational methods that...
This work will be focused on parallel simulation of electron-electron interactions in materials with...
The calculation of the semiclassical propagator is a Monte Carlo integration over classical trajecto...
Quantum computing proposes quantum algorithms exponentially faster than their clas- sical analogues ...
The Path-Integral Formulation of Quantum Mechanics is intro- duced along with a detailed mathematica...
Scientific computing applications demand ever-increasing performance while traditional microprocesso...
In the past few years the development of exascale computing technology necessitated to obtain an est...
Graphical Processing Units (GPUs) are highly parallel, programmable accelerators boasting high peak ...
AbstractIn the past few years the development of exascale computing technology necessitated to obtai...
Abstract: Modern videogames place increasing demands on the computational and graphical hardware, le...
Our goal was to investigate the suitability of parallel supercomputer architectures for Quantum Mont...
Many-particle continuous-time quantum walks (CTQWs) represent a resource for several tasks in quantu...
This thesis is concerned with the development and application of quantum Monte Carlo (QMC) methods f...
The major achievements enabled by QMC Endstation grant include * Performance improvement on clusters...
We will explore applications of computational methods in solving selected quantum mechanical problem...
The primary subject of this dissertation is the analysis and improvement of variational methods that...
This work will be focused on parallel simulation of electron-electron interactions in materials with...
The calculation of the semiclassical propagator is a Monte Carlo integration over classical trajecto...
Quantum computing proposes quantum algorithms exponentially faster than their clas- sical analogues ...