Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Physics Conference Series

Generalized Quantum Monte Carlo Algorithm in Eigen Basis

V. А. Kashurnikov, Andrey V. Krasavin, Yaroslav Zhumagulov, Petr F. Kartsev

Published Nov 1, 2019• 0 citations
Publisher

Abstract

Abstract New generalized continuous-time quantum Monte Carlo algorithm is developed. The algorithm is absolutely universal in the sense that it allows to calculate models specified in an arbitrary basis (in the basis of occupation numbers; in the momentum representation; in the basis of the eigenfunctions of small clusters into which the entire system is divided, or in any other basis): the algorithm requires only the specification of the matrix elements between the basis functions defined in a convenient basis. The implemented algorithm is applied to one-dimensional Hubbard model.

DOI
10.1088/1742-6596/1389/1/012080

Related papers

Quantum Monte Carlo algorithm for Bose-Hubbard models on arbitrary graphs

E. Akaturk, Itay Hen

We propose a quantum Monte Carlo algorithm capable of simulating the Bose-Hubbard model on arbitrary graphs, obviating the need for devising lattice-specific updates for different input graphs. We show that with our method, which is based on the recently introduced permutation matrix representation quantum Monte Carlo [Gupta, Albash, and Hen, J. Stat. Mech. (2020) 073105], the problem of adapting the simulation to a given geometry amounts to generating a cycle basis for the graph on which the model is defined, a procedure that can be carried out efficiently and in an automated manner. To showcase the versatility of our approach, we provide simulation results for Bose-Hubbard models defined on two-dimensional lattices as well as on a number of random graphs.

arXiv:2309.05166•Physical review. B./Physical review. B•Apr 25, 2024•10 citations

Effective quantum Monte Carlo algorithm for modeling strongly correlated systems

V. А. Kashurnikov, Andrey V. Krasavin

A new effective Monte Carlo algorithm based on principles of continuous time is presented. It allows calculating, in an arbitrary discrete basis, thermodynamic quantities and linear response of mixed boson-fermion, spin-boson, and other strongly correlated systems which admit no analytic description

Journal of Experimental and Theoretical Physics•Jul 1, 2007•8 citations

Electronic structure of BaBiOß: QMC CT-INT algorithm

Alexander E. Lukyanov, Vyacheslav D. Neverov, Andrey V. Krasavin +1 more

Abstract The continuous time quantum Monte Carlo algorithm with interaction expansion is implemented for Hubbard-Holstein model. Algorithm is approbated on the Bethe lattice with exact diagonalization technique and then is applied to calculate the self-energy of the BaBiO3 compound.

Journal of Physics Conference Series•Nov 1, 2019•0 citations

Continuous-time quantum Monte Carlo method for fermions

Alexey N. Rubtsov, V. V. Savkin, Alexander I. Lichtenstein

We present a numerically exact continuous-time quantum Monte Carlo algorithm for fermions with a general interaction nonlocal in space-time. The new determinantal grand-canonical scheme is based on a stochastic series expansion for the partition function in the interaction representation. The method is particularly applicable for multiband, time-dependent correlations since it does not invoke the Hubbard-Stratonovich transformation. The test calculations for exactly solvable models, as well results for the Green function and for the time-dependent susceptibility of the multiband supersymmetric model with a spin-flip interaction are discussed.

arXiv:cond-mat/0411344•Physical Review B•Jul 18, 2005•687 citations

Quantum Monte Carlo Developments For Discrete And Continuous Spaces

F. R. Petruzielo

This thesis details four research projects related to zero temperature quantum Monte Carlo. Chapters 2-4 focus on continuum quantum Monte Carlo, and specifically its application to molecular systems; whereas Chapter 5 focuses on quantum Monte Carlo in a discrete space. Chapter 2 focuses on improving upon the single-particle basis functions employed in quantum Monte Carlo calculations for molecular systems. For calculations requiring non-diverging pseudopotentials, a class of functions is introduced that is capable of producing the short- and long-range asymptotic behavior of the exact wavefunction. It is demonstrated that this form of basis function produces superior accuracy and efficiency when compared to the basis sets typically employed in quantum Monte Carlo. Although the basis functions introduced in Chapter 2 are capable of producing superior results, it is necessary that the parameters of the functional form are near-optimal for the full potential of the functions to be realized. Chapter 3 introduces a simple yet general method for constructing basis sets of a desired functional form appropriate for molecular electronic structure calculations. A standard basis set is created for each of the elements from hydrogen to argon. Chapter 4 explores the effect of different aspects of the trial wavefunction on the accuracy of quantum Monte Carlo. By systematically testing the effect of the basis size, orbital quality, and determinant expansion quality, this work offers guidance to quantum Monte Carlo practitioners for achieving results to within chemical accuracy of experiment. In Chapter 5, semistochastic projection, a hybrid of deterministic and stochastic projection, is introduced for finding the dominant eigenvalue and eigenvector of a matrix. This method, like stochastic projection, is applicable to matrices well beyond the size that can be handled by deterministic methods. Semistochastic projection improves over stochastic projection by significantly reducing the computational time required to obtain the eigenvalue within a specified statistical uncertainty. After the semistochastic projection method is introduced, it is applied to determine the ground state energy of the Hamiltonian in a discrete basis. This special case of semistochastic projection, dubbed semistochastic quantum Monte Carlo, is shown to be orders of magnitude more efficient than stochastic quantum Monte Carlo.

•May 27, 2012•0 citations

Quantum Monte Carlo determinantal algorithm without Hubbard-Stratonovich transformation: a general consideration

Alexey N. Rubtsov

Continuous-time determinantal algorithm is proposed for the quantum Monte Carlo simulation of the interacting fermions. The scheme does not invoke Hubbard-Stratonovich transformation. The fermionic action is divided into two parts. One of them contains the interaction and certain additional terms; another one is purely Gaussian. The first part is considered as a perturbation. Terms of the series expansion for the partition function are generated in a random walk process. The sign problem and the complexity of the algorithm are analyzed. We argue that the scheme should be useful particularly for the systems with non-local interaction.

arXiv:cond-mat/0302228•Feb 12, 2003•27 citations
Abstract New generalized continuous-time quantum Monte Carlo algorithm is developed. The algorithm is absolutely universal in the sense that it allows to calculate models specified in an arbitrary basis (in the basis of occupation numbers; in the momentum representation; in the basis of the eigenfunctions of small clusters into which the entire system is divided, or in any other basis): the algorithm requires only the specification of the matrix elements between the basis functions defined in a convenient basis. The implemented algorithm is applied to one-dimensional Hubbard model.
We propose a quantum Monte Carlo algorithm capable of simulating the Bose-Hubbard model on arbitrary graphs, obviating the need for devising lattice-specific updates for different input graphs. We show that with our method, which is based on the recently introduced permutation matrix representation quantum Monte Carlo [Gupta, Albash, and Hen, J. Stat. Mech. (2020) 073105], the problem of adapting the simulation to a given geometry amounts to generating a cycle basis for the graph on which the model is defined, a procedure that can be carried out efficiently and in an automated manner. To showcase the versatility of our approach, we provide simulation results for Bose-Hubbard models defined on two-dimensional lattices as well as on a number of random graphs.
We present a numerically exact continuous-time quantum Monte Carlo algorithm for fermions with a general interaction nonlocal in space-time. The new determinantal grand-canonical scheme is based on a stochastic series expansion for the partition function in the interaction representation. The method is particularly applicable for multiband, time-dependent correlations since it does not invoke the Hubbard-Stratonovich transformation. The test calculations for exactly solvable models, as well results for the Green function and for the time-dependent susceptibility of the multiband supersymmetric model with a spin-flip interaction are discussed.
This thesis details four research projects related to zero temperature quantum Monte Carlo. Chapters 2-4 focus on continuum quantum Monte Carlo, and specifically its application to molecular systems; whereas Chapter 5 focuses on quantum Monte Carlo in a discrete space. Chapter 2 focuses on improving upon the single-particle basis functions employed in quantum Monte Carlo calculations for molecular systems. For calculations requiring non-diverging pseudopotentials, a class of functions is introduced that is capable of producing the short- and long-range asymptotic behavior of the exact wavefunction. It is demonstrated that this form of basis function produces superior accuracy and efficiency when compared to the basis sets typically employed in quantum Monte Carlo. Although the basis functions introduced in Chapter 2 are capable of producing superior results, it is necessary that the parameters of the functional form are near-optimal for the full potential of the functions to be realized. Chapter 3 introduces a simple yet general method for constructing basis sets of a desired functional form appropriate for molecular electronic structure calculations. A standard basis set is created for each of the elements from hydrogen to argon. Chapter 4 explores the effect of different aspects of the trial wavefunction on the accuracy of quantum Monte Carlo. By systematically testing the effect of the basis size, orbital quality, and determinant expansion quality, this work offers guidance to quantum Monte Carlo practitioners for achieving results to within chemical accuracy of experiment. In Chapter 5, semistochastic projection, a hybrid of deterministic and stochastic projection, is introduced for finding the dominant eigenvalue and eigenvector of a matrix. This method, like stochastic projection, is applicable to matrices well beyond the size that can be handled by deterministic methods. Semistochastic projection improves over stochastic projection by significantly reducing the computational time required to obtain the eigenvalue within a specified statistical uncertainty. After the semistochastic projection method is introduced, it is applied to determine the ground state energy of the Hamiltonian in a discrete basis. This special case of semistochastic projection, dubbed semistochastic quantum Monte Carlo, is shown to be orders of magnitude more efficient than stochastic quantum Monte Carlo.
Continuous-time determinantal algorithm is proposed for the quantum Monte Carlo simulation of the interacting fermions. The scheme does not invoke Hubbard-Stratonovich transformation. The fermionic action is divided into two parts. One of them contains the interaction and certain additional terms; another one is purely Gaussian. The first part is considered as a perturbation. Terms of the series expansion for the partition function are generated in a random walk process. The sign problem and the complexity of the algorithm are analyzed. We argue that the scheme should be useful particularly for the systems with non-local interaction.