Abstract
Quantum impurity solvers have a broad range of applications in theoretical studies of strongly correlated electron systems. Especially, they play a key role in dynamical mean-field theory calculations of correlated lattice models and realistic materials. Therefore, the development and implementation of efficient quantum impurity solvers is an important task. In this paper, we present an open source interacting quantum impurity solver toolkit (dubbed iQIST). This package contains several highly optimized quantum impurity solvers which are based on the hybridization expansion continuous-time quantum Monte Carlo algorithm, as well as some essential pre- and post-processing tools. We first introduce the basic principle of continuous-time quantum Monte Carlo algorithm and then discuss the implementation details and optimization strategies. The software framework, major features, and installation procedure for iQIST are also explained. Finally, several simple tutorials are presented in order to demonstrate the usage and power of iQIST. Program summaryProgram title:iQISTCatalogue identifier: AEWQ_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEWQ_v1_0.htmlProgram obtainable from: CPC Program Library, Queen’s University, Belfast, N. IrelandLicensing provisions: GNU General Public License, version 3No. of lines in distributed program, including test data, etc.: 226270No. of bytes in distributed program, including test data, etc.: 5263144Distribution format: tar.gzProgramming language: Fortran 2008 and Python.Computer: Desktop PC, laptop, high performance computing cluster.Operating system: Unix, Linux, Mac OS X, Windows.Has the code been vectorized or parallelized?: Yes, it is parallelized by MPI and OpenMPRAM: Depends on the complexity of the problemClassification: 7.3.External routines: BLAS, LAPACK, Latex is required to build the user manual.Nature of problem:Quantum impurity models were originally proposed to describe magnetic impurities in metallic hosts. In these models, the Coulomb interaction acts between electrons occupying the orbitals of the impurity atom. Electrons can hop between the impurity and the host, and in an action formulation, this hopping is described by a time-dependent hybridization function. Nowadays quantum impurity models have a broad range of applications, from the description of heavy fermion systems, and Kondo insulators, to quantum dots in nano-science. They also play an important role as auxiliary problems in dynamical mean-field theory and its diagrammatic extensions [1–3], where an interacting lattice model is mapped onto a quantum impurity model in a self-consistent manner. Thus, the accurate and efficient solution of quantum impurity models becomes an essential task.Solution method:The quantum impurity model can be solved by the numerically exact continuous-time quantum Monte Carlo method, which is the most efficient and powerful impurity solver for finite temperature simulations. In the iQIST software package, we implemented the hybridization expansion version of continuous-time quantum Monte Carlo algorithm. Both the segment representation and general matrix formalism are supported. The key idea of this algorithm is to expand the partition function diagrammatically in powers of the impurity-bath hybridization, and to stochastically sample these diagrams to all relevant orders using the Metropolis Monte Carlo algorithm. For a detailed review of the continuous-time quantum Monte Carlo algorithms, please refer to [4].Running time:Depends on the complexity of the problem. The sample run supplied in the distribution takes about 1.5 minutes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.