Quantum Monte Carlo Algorithms for the Quantum Cluster Problem

نویسندگان

  • M. Jarrell
  • K. Mikelsons
چکیده

We present a pedagogical discussion of the the Hirsch-Fye and Continuous time Quantum Monte Carlo (QMC) algorithms which may be used to study a correlated cluster embedded in an uncorrelated host, or used to solve the cluster problem in dynamical mean field theory (DMFT) or its cluster extensions. The basic algorithms are discussed, together with methods for efficient measurments and the modifications required by the self-consistency of the DMFT. PACS: 02.70.Ss, 02.60.Pn, 71.27.+a

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Histogram Methods for Quantum Systems: from Reweighting to Wang-Landau Sampling

Quantum Monte Carlo simulations have become almost as powerful as classical simulations, despite their usually more complex formulation and implementation. Not only local update algorithms,[1] but also generalizations of the classical cluster Monte Carlo algorithms [2] have been developed for quantum systems, solving the problem of critical slowing down at some important second order phase tran...

متن کامل

Cluster Monte Carlo Algorithms for Dissipative Quantum Systems

Dissipation and decoherence in quantum systems have important practical implications, from stabilizing superconductivity in granular materials, to the loss of information stored in qubits. In all the models we study, energy dissipation is introduced by coupling a quantum mechanical degree of freedom to a bath of suitably chosen harmonic oscillators. The degrees of freedom of this bath can be in...

متن کامل

From Monte Carlo to quantum computation

Quantum computing was so far mainly concerned with discrete problems. Recently, E. Novak and the author studied quantum algorithms for high dimensional integration and dealt with the question, which advantages quantum computing can bring over classical deterministic or randomized methods for this type of problem. In this paper we give a short introduction to the basic ideas of quantum computing...

متن کامل

The Full Configuration Interaction Quantum Monte Carlo Method in the Lens of Inexact Power Iteration

In this paper, we propose a general analysis framework for inexact power iteration, which can be used to efficiently solve high dimensional eigenvalue problems arising from quantum many-body problems. Under the proposed framework, we establish the convergence theorems for several recently proposed randomized algorithms, including the full configuration interaction quantum Monte Carlo (FCIQMC) a...

متن کامل

Computational study of Anticancer Dasatinib for drug delivery systems

Dasatinib is a tyrosine kinase inhibitor (TKI) that is used to treat chronic myeloid leukemia and in the management of ulcerative colitis (UC) and to provide appropriate results in treatment. Dasatinib is significantly higher and faster than full cytogenetic and large molecular responses as compared to imatinib. In the recent study, using the NMR data, the frequency and thermochemical propertie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011