-
Notifications
You must be signed in to change notification settings - Fork 5
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Can we use this method to projector QMC? #13
Comments
Hi @liuzhaochen, I'm happy to hear that you find the code useful!
Certainly! The meaning of the slice matrices
Yes, 90% of the computations have been performed in Julia - an extensive effort taking up millions of CPU hours (an O(3) quantum critical metal is a super hard problem). The performance of julia was great. You certainly have to optimize your code, but then you achieve similar performance as with Fortran or C++ (I compared to both). I will publish the actual code that I used for these simulations later this years (probably in summer). You can find a simplified version in MonteCarlo.jl (in particular you should check out ffreyer's fork/branches. All the best, |
Thanks for your reply. I have organized my code about hubbard model successfully. Looking forward for your code in the furture. Is it possible to speed up matrix operation parallelly? It seems I can only use one worker in one Markov chain. Best Wishes |
You can use |
Hi crstnbr!
Thanks for your excellent code and your benchmark for different methods. I am a newcomer to QMC. Recently I am studying the Projector QMC. I wonder if it is possible to use your method in PQMC? And I noticed you just submitted a paper on arXiv about monte carlo calculation. Did you perform the calculation with julia? How's the performance of julia on DQMC calculation?
Best Wishes
The text was updated successfully, but these errors were encountered: