Principles of continuous-time quantum Monte Carlo algorithm
Now we already have an impurity model Hamiltonian , the question is how to solve it using the Monte Carlo algorithm?
We first split the impurity Hamiltonian into two separate parts,
then treat as a perturbation term, and expand the partition function in powers of , with where is defined in the interaction picture with
Each term in the right side of the second equation can be regarded as a diagram or configuration (labeled by ), and is the diagrammatic weight of a specific order- configuration. Next we use a stochastic Monte Carlo algorithm to sample the terms of this series. This is the core spirit of the continuous-time quantum Monte Carlo impurity solver. The idea is very simple, but the realization is not.
Depending on the different choices of term, there are multiple variations for the continuous-time quantum Monte Carlo impurity solver. According to our knowledge, the variations at least include
- CT-INT
- CT-HYB
- CT-J
- CT-AUX
In the CT-INT and CT-AUX quantum impurity solvers1,2, the interaction term is the perturbation term, namely, , while is chosen for the CT-HYB quantum impurity solver3. The CT-J quantum impurity solver is designed for the Kondo lattice model only4. We won't discuss it at here. In the intermediate and strong interaction region, CT-HYB is much more efficient than CT-INT and CT-AUX. We could even say that it is the most powerful and efficient quantum impurity solver so far. This is also the main reason that we only implemented the CT-HYB quantum impurity solvers in the QIST software package.
Reference
1 A. N. Rubtsov, V. V. Savkin, and A. I. Lichtenstein, Phys. Rev. B 72, 035122 (2005)
2 Emanuel Gull, Philipp Werner, Olivier Parcollet, Matthias Troyer, EPL 82, 57003 (2008)
3 Philipp Werner, Armin Comanac, Luca de’ Medici, Matthias Troyer, and Andrew J. Millis, Phys. Rev. Lett. 97, 076405 (2006)
4 Junya Otsuki, Hiroaki Kusunose, Philipp Werner, and Yoshio Kuramoto, J. Phys. Soc. Jpn. 76, 114707 (2007)